HDOJ 5240 Exam 【简单模拟】
来源:互联网 发布:淘宝基础班导航条全屏 编辑:程序博客网 时间:2024/05/22 02:13
Exam
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1041 Accepted Submission(s): 521
Problem Description
As this term is going to end, DRD needs to prepare for his final exams.
DRD hasn exams. They are all hard, but their difficulties are different. DRD will spend at leastri hours on the i -th course before its exam starts, or he will fail it. The i -th course's exam will take place ei hours later from now, and it will last for li hours. When DRD takes an exam, he must devote himself to this exam and cannot (p)review any courses. Note that DRD can review for discontinuous time.
So he wonder whether he can pass all of his courses.
No two exams will collide.
DRD has
So he wonder whether he can pass all of his courses.
No two exams will collide.
Input
First line: an positive integer T≤20 indicating the number of test cases.
There are T cases following. In each case, the first line contains an positive integern≤105 , and n lines follow. In each of these lines, there are 3 integers ri,ei,li , where 0≤ri,ei,li≤109 .
There are T cases following. In each case, the first line contains an positive integer
Output
For each test case: output ''Case #x: ans'' (without quotes), wherex is the number of test cases, and ans is ''YES'' (without quotes) if DRD can pass all the courses, and otherwise ''NO'' (without quotes).
Sample Input
233 2 25 100 27 1000 233 10 25 100 27 1000 2
Sample Output
Case #1: NOCase #2: YES
恩,题目大意就是说,预习一科目所需时间,多久后考试开始,考试持续时间,问能否在所有时间不冲突的情况下完成所有科目,就排序然后更新一下(个人看法)
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>#define maxn 100000+10using namespace std;struct Node{ int t,s,l;};Node node[maxn];int cmp(Node a,Node b){ return a.s<b.s;}int main(){ int t,n,cnt=0; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;++i) scanf("%d%d%d",&node[i].t,&node[i].s,&node[i].l); sort(node,node+n,cmp); int flag=1; for(int i=0;i<n;++i) { if(node[i].t>node[i].s) { flag=0; break; } node[i+1].t+=node[i].t+node[i].l; } printf("Case #%d: ",++cnt); if(flag) printf("YES\n"); else printf("NO\n"); } return 0;}
0 0
- HDOJ 5240 Exam 【简单模拟】
- hdoj 5240 Exam 【模拟】
- HDOJ 5240 Exam 【sort排序&&模拟】
- hdoj Exam 5240 (简单逻辑题)
- hdoj--5240--Exam()
- HDOJ 5240 Exam(水)
- hdoj 5240 Exam
- hdoj 5240 Exam
- hdoj 5240 Exam【贪心】
- HDOJ 5240 Exam
- HDOJ 5240 Exam
- HDOJ 5240 Exam (贪心)
- HDOJ 4473 Exam 暴力枚举
- HDOJ 4272 LianLianKan(简单模拟)
- HDOJ 1177 "Accepted today?" (简单模拟)
- HDOJ 1200 To and Fro(简单模拟)
- hdoj 简单计算器 1237 (栈模拟)
- hdoj--1237--简单计算器(栈模拟)
- JS-语句
- C++智能指针
- iOS中的GCD(2)---获取队列方法
- JS-数组
- JS-函数
- HDOJ 5240 Exam 【简单模拟】
- 集合List的使用 (例子+概念)
- 线段相交算法——平面扫描(可用于空间连接查询过滤)
- 线程的互斥
- java中leetcode题目求字符创匹配的问题
- 使用VS2010调用QtDesigner设计的UI文件,并实现控件功能
- Linux下搭LNMP
- 关于使用Git&Bitbucket的一些Tips
- Android Animation之补间动画