# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315701 | juggernaut | Jousting tournament (IOI12_tournament) | C++14 | 51 ms | 3320 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
Try to solve
Solve it
AND NEVER BACK TO THIS PROBLEM AGAIN
*/
#include<bits/stdc++.h>
#ifdef EVAL
#else
#include"grader.cpp"
#endif
using namespace std;
const int Z=1<<17;
int nxt[Z],cnt[Z<<1],add[Z],res[Z];
int gt(int n){
int x=1;
while(x<Z){
x<<=1;
if(cnt[x]<n)n-=cnt[x++];
}
return x-Z;
}
void up(int x,int val){
while(x){
cnt[x]+=val;
x>>=1;
}
}
int GetBestPosition(int N,int C,int R,int *K,int *S,int *E){
int i,tmp,x,y,sum=0,mx=-1,id;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |