Submission #5493798
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <cassert> #include <queue> const int N=2e5+5; int n,m; struct data{ int l,r; friend bool operator < (const data &a,const data &b){ return a.l==b.l?a.r<b.r:a.l>b.l; } }; namespace utils{ inline int nxi(FILE *fd=stdin){ int x=0; char c; while(((c=fgetc(fd))>'9'||c<'0')&&c!='-'); const bool f=(c=='-')&&(c=fgetc(fd)); while(x=x*10-48+c,(c=fgetc(fd))>='0'&&c<='9'); return f?-x:x; } template <class T> inline void apx(T &x,const T y){ x<y?x=y:0; } template <class T> inline void apn(T &x,const T y){ x>y?x=y:0; } } using namespace utils; int main(){ std::priority_queue <int> r_que; std::priority_queue <data> d_que; n=nxi(),m=nxi(); for(int i=1; i<=n; ++i){ data x; x.l=nxi(),x.r=nxi(); d_que.push(x); } for(int i=1; i<=m; ++i){ while(!d_que.empty()&&d_que.top().l<i){ r_que.push(-d_que.top().r); d_que.pop(); } if(!d_que.empty()) d_que.pop(); else if(!r_que.empty()&&-r_que.top()<=i) r_que.pop(); } printf("%d\n",(int)(d_que.size()+r_que.size())); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Exhausted? |
User | qzkszj |
Language | C++ (GCC 5.4.1) |
Score | 1000 |
Code Size | 1135 Byte |
Status | AC |
Exec Time | 64 ms |
Memory | 3568 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 51 ms | 2420 KB |
02.txt | AC | 29 ms | 1400 KB |
03.txt | AC | 59 ms | 2420 KB |
04.txt | AC | 62 ms | 2420 KB |
05.txt | AC | 3 ms | 384 KB |
06.txt | AC | 40 ms | 2420 KB |
07.txt | AC | 58 ms | 3312 KB |
08.txt | AC | 59 ms | 2420 KB |
09.txt | AC | 53 ms | 2672 KB |
10.txt | AC | 14 ms | 892 KB |
11.txt | AC | 56 ms | 3568 KB |
12.txt | AC | 40 ms | 2928 KB |
13.txt | AC | 54 ms | 3568 KB |
14.txt | AC | 55 ms | 3568 KB |
15.txt | AC | 56 ms | 3568 KB |
16.txt | AC | 34 ms | 1652 KB |
17.txt | AC | 62 ms | 2672 KB |
18.txt | AC | 63 ms | 2672 KB |
19.txt | AC | 54 ms | 2544 KB |
20.txt | AC | 62 ms | 2672 KB |
21.txt | AC | 11 ms | 892 KB |
22.txt | AC | 64 ms | 2672 KB |
23.txt | AC | 8 ms | 640 KB |
24.txt | AC | 64 ms | 2672 KB |
25.txt | AC | 31 ms | 3056 KB |
26.txt | AC | 30 ms | 2928 KB |
27.txt | AC | 38 ms | 3440 KB |
28.txt | AC | 39 ms | 3568 KB |
29.txt | AC | 49 ms | 2420 KB |
30.txt | AC | 49 ms | 2420 KB |
31.txt | AC | 63 ms | 2672 KB |
32.txt | AC | 53 ms | 2420 KB |
33.txt | AC | 64 ms | 2672 KB |
34.txt | AC | 38 ms | 1780 KB |
35.txt | AC | 29 ms | 1524 KB |
36.txt | AC | 62 ms | 2672 KB |
37.txt | AC | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 1 ms | 256 KB |