Submission #1378411
Source Code Expand
#include <stdio.h> #include <algorithm> #include <vector> using namespace std; pair<int, int> p[200010]; const int Z = (1<<18); int sum[Z*2],pr[Z*2]; void in(int x, int p) { x += Z; sum[x] += p; pr[x] = min(0,p); x /= 2; while (x){ sum[x] = sum[x * 2] + sum[x * 2 + 1]; pr[x] = min(pr[x*2], sum[x*2] + pr[x*2+1]); x /= 2; } } int main() { int N,M; scanf ("%d %d",&N,&M); for (int i=0;i<N;i++){ scanf ("%d %d",&p[i].first,&p[i].second); p[i].second = -p[i].second; } sort(p,p+N); for (int i=1;i<=M;i++) in(i,-1); for (int i=0;i<N;i++){ p[i].second = -p[i].second; } int l = 0, r = 0; vector<int> u; for (int i=0;i<N;i++){ if (p[i].first >= l + 1){ u.push_back(p[i].second); l++; } else{ in(p[i].second,1); while (M+pr[1] >= r + 1) r++; } } int ans = l + r; sort(u.rbegin(),u.rend()); for (auto &x : u){ l--; in(x,1); while (M+pr[1] >= r + 1) r++; ans = max(ans,l+r); } if (ans > M) ans = M; if (ans > N) ans = N; printf ("%d\n",N-ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Exhausted? |
User | august14 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1084 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 6520 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d %d",&N,&M); ^ ./Main.cpp:28:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%d %d",&p[i].first,&p[i].second); ^
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 | 75 ms | 5500 KB |
02.txt | AC | 55 ms | 5372 KB |
03.txt | AC | 86 ms | 6520 KB |
04.txt | AC | 88 ms | 6520 KB |
05.txt | AC | 8 ms | 3072 KB |
06.txt | AC | 65 ms | 5372 KB |
07.txt | AC | 73 ms | 4864 KB |
08.txt | AC | 87 ms | 6520 KB |
09.txt | AC | 73 ms | 5116 KB |
10.txt | AC | 33 ms | 4608 KB |
11.txt | AC | 71 ms | 5248 KB |
12.txt | AC | 56 ms | 4992 KB |
13.txt | AC | 62 ms | 4096 KB |
14.txt | AC | 62 ms | 4096 KB |
15.txt | AC | 73 ms | 5376 KB |
16.txt | AC | 45 ms | 4480 KB |
17.txt | AC | 76 ms | 6012 KB |
18.txt | AC | 77 ms | 6012 KB |
19.txt | AC | 74 ms | 5884 KB |
20.txt | AC | 80 ms | 6012 KB |
21.txt | AC | 25 ms | 4352 KB |
22.txt | AC | 75 ms | 6012 KB |
23.txt | AC | 13 ms | 2944 KB |
24.txt | AC | 75 ms | 6012 KB |
25.txt | AC | 47 ms | 4992 KB |
26.txt | AC | 38 ms | 3968 KB |
27.txt | AC | 63 ms | 5376 KB |
28.txt | AC | 60 ms | 4736 KB |
29.txt | AC | 68 ms | 6520 KB |
30.txt | AC | 67 ms | 6520 KB |
31.txt | AC | 76 ms | 6012 KB |
32.txt | AC | 73 ms | 5884 KB |
33.txt | AC | 80 ms | 6012 KB |
34.txt | AC | 54 ms | 4992 KB |
35.txt | AC | 46 ms | 4992 KB |
36.txt | AC | 75 ms | 6012 KB |
37.txt | AC | 2 ms | 2304 KB |
38.txt | AC | 2 ms | 2304 KB |
39.txt | AC | 2 ms | 2304 KB |
40.txt | AC | 2 ms | 2304 KB |
41.txt | AC | 2 ms | 2304 KB |
42.txt | AC | 2 ms | 2304 KB |
43.txt | AC | 13 ms | 3840 KB |
44.txt | AC | 1 ms | 2304 KB |
s1.txt | AC | 2 ms | 2304 KB |
s2.txt | AC | 2 ms | 2304 KB |
s3.txt | AC | 2 ms | 2304 KB |
s4.txt | AC | 2 ms | 2304 KB |