#include <bits/extc++.h>
int a[100001],s[100001],e[100001];
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
struct p {int x,y;};
__gnu_cxx::rope<p> g;
int cnt = 0;
for (int i = 0; i < N-1; i++) if (K[i] > R)
s[i+1]++,e[i]++,cnt++;
for (int i = 0; i < N; i++)
s[i+1]+=s[i],e[N-1-i]+=e[N-i],g.push_back({i,i});
for (int i = 0; i < C; i++) {
int l=g[S[i]].x,r=g[E[i]].y;
g.erase(S[i],E[i]-S[i]+1);
g.insert(S[i],{l,r});
if (s[l]+e[r]==cnt) a[l]++,a[r+1]--;
}
int c=a[0],b=c,j=0;
for (int i = 1; i <= N; i++) if (b < (c+=a[i])) b=c,j=i;
return j;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
308 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
6 ms |
600 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
5 ms |
596 KB |
Output is correct |
5 |
Correct |
5 ms |
468 KB |
Output is correct |
6 |
Correct |
6 ms |
596 KB |
Output is correct |
7 |
Correct |
5 ms |
596 KB |
Output is correct |
8 |
Correct |
5 ms |
596 KB |
Output is correct |
9 |
Correct |
1 ms |
468 KB |
Output is correct |
10 |
Correct |
11 ms |
688 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
84 ms |
3488 KB |
Output is correct |
2 |
Correct |
107 ms |
4720 KB |
Output is correct |
3 |
Correct |
23 ms |
3932 KB |
Output is correct |
4 |
Correct |
111 ms |
5004 KB |
Output is correct |
5 |
Correct |
108 ms |
4608 KB |
Output is correct |
6 |
Correct |
177 ms |
5988 KB |
Output is correct |
7 |
Correct |
102 ms |
4908 KB |
Output is correct |
8 |
Correct |
102 ms |
4764 KB |
Output is correct |
9 |
Correct |
13 ms |
3668 KB |
Output is correct |
10 |
Correct |
30 ms |
4328 KB |
Output is correct |