Submission #754188

#TimeUsernameProblemLanguageResultExecution timeMemory
754188nicksmsJousting tournament (IOI12_tournament)C++17
100 / 100
186 ms7120 KiB
#include <bits/extc++.h> int a[100001],s[100000],e[100000]; 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 = 1; i < N; i++) s[i]+=s[i-1]; for (int i = N-2; i >= 0; i--) e[i]+=e[i+1]; for (int i = 0; i < 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...