B. Sereja and Contests
来源:互联网 发布:淘宝网十二伏鹰眼灯 编辑:程序博客网 时间:2024/05/22 05:12
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: Div1 (for advanced coders) and Div2 (for beginner coders). Two rounds, Div1 and Div2, can go simultaneously, (Div1 round cannot be held without Div2) in all other cases the rounds don't overlap in time. Each round has a unique identifier — a positive integer. The rounds are sequentially (without gaps) numbered with identifiers by the starting time of the round. The identifiers of rounds that are run simultaneously are different by one, also the identifier of the Div1 round is always greater.
Sereja is a beginner coder, so he can take part only in rounds of Div2 type. At the moment he is taking part in a Div2 round, its identifier equals to x. Sereja remembers very well that he has taken part in exactly k rounds before this round. Also, he remembers all identifiers of the rounds he has taken part in and all identifiers of the rounds that went simultaneously with them. Sereja doesn't remember anything about the rounds he missed.
Sereja is wondering: what minimum and what maximum number of Div2 rounds could he have missed? Help him find these two numbers.
The first line contains two integers: x (1 ≤ x ≤ 4000) — the round Sereja is taking part in today, and k (0 ≤ k < 4000) — the number of rounds he took part in.
Next k lines contain the descriptions of the rounds that Sereja took part in before. If Sereja took part in one of two simultaneous rounds, the corresponding line looks like: "1 num2 num1" (where num2 is the identifier of this Div2 round, num1 is the identifier of the Div1round). It is guaranteed that num1 - num2 = 1. If Sereja took part in a usual Div2 round, then the corresponding line looks like: "2num" (where num is the identifier of this Div2 round). It is guaranteed that the identifiers of all given rounds are less than x.
Print in a single line two integers — the minimum and the maximum number of rounds that Sereja could have missed.
3 22 12 2
0 0
9 31 2 32 81 4 5
2 3
10 0
5 9
In the second sample we have unused identifiers of rounds 1, 6, 7. The minimum number of rounds Sereja could have missed equals to 2. In this case, the round with the identifier 1 will be a usual Div2 round and the round with identifier 6 will be synchronous with the Div1round.
题意:输入n,x,表示你现在正在参加的比赛和你参加了几场比赛,求你最少和最多错过参加的比赛数
#include<iostream>#include <cstring>#include <cstdio>#include<algorithm>using namespace std;int main(){ int n,k,b,c,d,t1; int a[4005],ans[4005]; while(scanf("%d%d",&n,&k)!=EOF) { memset(a,0,sizeof(a)); for(int i=0;i<k;i++) { cin>>b; if(b==2) { cin>>t1; a[t1]=1; } else { cin>>c>>d; a[c]=1; a[d]=1; } } int sum=0; int t=0; for(int i=1;i<n;i++) { if(!a[i]) { ans[t++]=i; } } for(int i=0;i<t;i++) { int flag=ans[i+1]-ans[i]; if(flag==1) i++; sum++; } cout<<sum<<" "<<t<<endl; } return 0;}
- B. Sereja and Contests
- B. Sereja and Contests
- codeforces B. Sereja and Contests
- (CF)B. Sereja and Contests
- code forces 401B Sereja and Contests
- codeforces 401B - Sereja and Contests
- CF 401B Sereja and Contests
- Codeforces 401B Sereja and Contests(DP)
- CodeForces 401B Sereja and Contests
- Codeforces 401B Sereja and Contests【水题】
- Codeforces Round #235 (Div. 2)B. Sereja and Contests
- Codeforces 401B Sereja and Contests(水题)
- codeforces#235_div2_B Sereja and Contests
- B. Sereja and Array
- B. Sereja and Suffixes
- B. Sereja and Stairs
- B. Sereja and Mirroring
- B. Sereja and Mirroring
- Linux 原子操作
- android Animation动画
- 入派三声
- 教你自制触摸屏
- interactive governor study for android
- B. Sereja and Contests
- 一段图片左右箭头之上一张下一张
- 多国参与搜救失联客机 中国启动最强救援
- 线性表操作
- JDBC中解决in查询超级解决方案
- 聚簇索引
- IOS:百度地图学习3
- VS2008 断点失效的解决办法
- Java中的回调函数学习