Getting Driving License

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 347    Accepted Submission(s): 78

Problem Description
Have you got a driving license? Acquiring a driving license brings
you a lot of benefits. You will regret for not passing the driving test
or getting a driving license in your campus life. Why?College life is
filled with much spare time,which you can use to improve yourself in
many fields such as driving.
During the time of taking driving
lessons,Samuel met a lot of classmates whose time are occupied by their
own work. The fact that they have little time to practice makes getting
driving license increasingly difficult. Passing the driving test as
soon as possible is suggested by these mates to the our college students
who cannot drive.
Know something about the driving test you
can read the information in the background section,however,it is not
related with this problem firmly. Surely,you can go to the problem
section directly.
Here is the background information on owning driving licenses in China mainland:
To get a driving license successfully,you need to take about 4 tests at least.
The first part is the theory exam which helps you know clearly
about the transportation law in China mainland and other driving theory.
The second is to test you whether you can drive a car forward
out and backward in the garage at a very low speed(like aunts
moving),move the car from one garage to another and drive out.

The third section you need to pass is a little difficult than the
second test. In this section,you should be able to drive to avoid the
obstacles on the road,manage your car pass S formed way(your car's
wheels can not be moved onto one of the tracks which leads your way
out),after that you may have to make your car pass the 90 degree angle
track,then pass the course equipped with very low bridge using one side
of your car's wheel and so on.
The forth part which is test
the same day with the third test is called road driving test(but in the
problem I designed the time between Part 3 and Part 4 is 1 month,just
want to make the problem much easier).As you can refer from the word,it
tests the ability of driving on the road,it is more practical and of
more importance.
If you seems not very lucky,you will have
fifth section(The problem does not include the 5th part,you can ignore
it in solving the problem).In this part you are required to driving at
night which involves changing lights in addition . Teachers never taught
how to drive at night unless your group is asked to take part in this
test. But on the contrary,taught how to driving at night,of course,is
necessary. Samuel had an experience of taking the fifth test to get the
driving license in the summer of 2008. Tell you a secret,next time you
meet a car comes from an opposite direction and the driver of that car
does not change his front lights ,it probably means he/she needs special
training on how to drive at night.
To get a driving
license,you should pass the 4 parts one by one. For example,if you
failed in the section 2,you have to retry for a second time,third
time...before you pass. After that you have the opportunity to enter
Part 3.
Here is the problem section you need read patiently:
Some details you need to know:
1.The time between the two tests is generally about 1 month(If
you fail in the test on your first attempt,you can try it a second time.
Fail again the second time he have to go home and retry after 1 month).

2.And the time from you take the first test to your owning a license is within 2 years.
3.What's more,the passing score in Part 1 test is 90(that is to
say if you get 89 or even lower at your first attempt,a second attempt
is needed. You will pass until you get 90 or higher at the second
time)and each of the rest parts the passing score is 80 at least.
 
Input
The input consists 2 major sections as usual,
the
test cases t,each of the test case involves an integer n and n scores
one gets in the test and with n scores he passed the test or he failed
to pass in the 2 years(of course here n>=4). All the number here are
integers.
 
Output
Output
is simple. Just output the time one needs to get a driving license (if
time is within 2 years)using the format “It takes about m months to get a
driving license.”If time is beyond 2 years please output the sentence
“He failed to get a driving license within 2 years! ”
 
Sample Input
3
5
89 90 95 84 80
7
80 90 70 80 75 85 80
7
80 90 70 70 80 85 85
 
Sample Output
It takes about 3 months to get a driving license.
It takes about 3 months to get a driving license.
It takes about 4 months to get a driving license.
Hint: In the first case:first attempt on trying theory test was totally a failure,so he tried a second time the same day and he succeeded. The second test was taken 1 month later,so it cost 1 month so far. Fortunately, he passed. After 1 month he took part 3 and he passed,he waited for another 1 month to attend the part 4 test and succeed. So the total time he needs is 3 months. In the second case:80 90(part 1,passed)70 80(1 months later passed)75 85 (another 1 month he succeed)80(1 month later he passed and he get the license finally).It took 3 months. In the 3rd case the second part he took for three times ,so you need to add another 1 month to the result of the second case. Hope I have made myself understood.
模拟,第三部分和第四部分有点特殊,前两个部分每月只有两次机会,用完月份加一,考试通过月份加一,注意两年未通过输出时最后没有空格。
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <ctime>
#include <map>
#include <set>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define pi acos(-1.0)
#define ei exp(1)
#define PI 3.141592653589793238462
#define ios() ios::sync_with_stdio(false)
#define INF 1044266558
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
int n,x,t;
int main()
{
scanf("%d",&t);
while(t--)
{
int pos=,ok=,flag=,k=;
scanf("%d",&n);
for(int i=;i<n;i++)
{
scanf("%d",&x);
//printf("%d %d\n",x,pos);
if(flag==)
{
if(x<) ok++;
else if(x>=) {ok=;pos++,flag=;continue;}
if(ok==) pos+=,ok=;
}
else if(flag==)
{
if(x<) ok++;
else if(x>=) {ok=;pos++,flag=;continue;}
if(ok==) pos+=,ok=;
}
else if(flag==)
{
if(k==)
{
if(x<) ok++;
else if(x>=) {ok=;k=;continue;}
if(ok==) pos+=;
}
else if(k==)
{
if(x<) ok++;
else if(x>=) {ok=;continue;}
if(ok==) pos+=;
}
}
}
if(pos<=) printf("It takes about %d months to get a driving license.\n",pos);
else printf("He failed to get a driving license within 2 years!\n");
}
return ;
}
/*
4
17
70 70 70 70 95 70 70 70 95 70 70 70 95 70 70 70 95
5
89 90 95 84 80
7
80 90 70 80 75 85 80
7
80 90 70 70 80 85 85
*/

HDU 2633 Getting Driving License(模拟)的更多相关文章

  1. HDU 4041 Eliminate Witches! (模拟题 ACM ICPC 2011亚洲北京赛区网络赛)

    HDU 4041 Eliminate Witches! (模拟题 ACM ICPC 2011 亚洲北京赛区网络赛题目) Eliminate Witches! Time Limit: 2000/1000 ...

  2. HDU 5948 Thickest Burger 【模拟】 (2016ACM/ICPC亚洲区沈阳站)

    Thickest Burger Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)T ...

  3. HDU 5920 Ugly Problem 【模拟】 (2016中国大学生程序设计竞赛(长春))

    Ugly Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Tota ...

  4. HDU 5873 Football Games 【模拟】 (2016 ACM/ICPC Asia Regional Dalian Online)

    Football Games Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)To ...

  5. HDU 4814 Golden Radio Base 模拟

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4814 题目大意: 把一个正整数表示为φ进制, φ = (1+√5)/2 . 且已知: 1. φ + 1 ...

  6. HDU 5504 GT and sequence 模拟

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5504 思路:模拟 代码: #include<stdio.h>//------杭电5504 ...

  7. hdu 5071 vector操作恶心模拟

    http://acm.hdu.edu.cn/showproblem.php?pid=5071 对于每一个窗口,有两个属性:优先级+说过的单词数,支持8个操作:新建窗口,关闭窗口并输出信息,聊天(置顶窗 ...

  8. hdu 4902 线段树+逆向模拟

    http://acm.hdu.edu.cn/showproblem.php?pid=4902 出n个数,然后对这n个数进行两种操作: 如果是 1 l r x,则把 [l, r] 区间里面的每一个数都变 ...

  9. HDU 5186 zhx's submissions 模拟,细节 难度:1

    http://acm.hdu.edu.cn/showproblem.php?pid=5186 题意是分别对每一位做b进制加法,但是不要进位 模拟,注意:1 去掉前置0 2 当结果为0时输出0,而不是全 ...

随机推荐

  1. sql server 中查询数据库下有多少张表以及同义词等信息

    --查询数据库有多少张表SELECT count(0) from sysobjects where xtype = 'u' 复制代码 解释:sysobjects系统对象表. 保存当前数据库的对象.如约 ...

  2. 细说ReactiveCocoa的冷信号与热信号(一)

    热信号:事件触发: 冷信号:订阅出发: 从本质上来说,是信号的存在和产生,是静态信号和动态信号的区别. 背景 ReactiveCocoa(简称RAC)是最初由GitHub团队开发的一套基于Cocoa的 ...

  3. HTML图片映射

    <img>图片映射 <map>与<area>一起使用来定义一个图像映射(一个可点击的链接区域). <img src="cat.jpg" a ...

  4. 【Educational Codeforces Round 37 E】Connected Components?

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] bfs. 用一个链表来记录哪些点已经确定在某一个联通快里了. 一开始每个点都能用. 然后从第一个点开始进行bfs. 然后对于它的所有 ...

  5. DATA_PUMP_DIR impdp 指定导出目录

    1.mkdir /tdms1/oracle/dump 2.sqlplus / as sysdba 3.create directory udir as '/tdms1/oracle/dump'; 4. ...

  6. Android异步载入全解析之开篇瞎扯淡

    Android异步载入 概述 Android异步载入在Android中使用的很广泛,除了是由于避免在主线程中做网络操作.更是为了避免在显示时由于时间太长而造成ANR,添加显示的流畅性,特别是像List ...

  7. (hdu step 7.2.1)The Euler function(欧拉函数模板题——求phi[a]到phi[b]的和)

    题目: The Euler function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe ...

  8. 使用maven运行单元測试总结

    maven本身没有单元測试框架,可是maven的default生命周期的test阶段绑定了maven-surefire-plugin插件,该插件能够调用Junit3.Junit4.TestNG等Jav ...

  9. Java 8 时间日期库的20个使用演示样例

    除了lambda表达式,stream以及几个小的改进之外,Java 8还引入了一套全新的时间日期API,在本篇教程中我们将通过几个简单的任务演示样例来学习怎样使用Java 8的这套API.Java对日 ...

  10. ajax --- 解决ajax跨域请求导致session失效的问题

    起因:http是无状态的,因此我们通常需要用到cookie以及session来保存状态,session是在服务器端存储的,会和cookie一起使用,设置了session之后,会发送给浏览器一个cook ...