# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16729 | CodingBug | Jousting tournament (IOI12_tournament) | C++98 | 110 ms | 10896 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.
#include <stdio.h>
#include <algorithm>
#define M 100000
using namespace std;
struct IdxTree{
int a[1<<18],l,n;
void init(int N){
n=N;
for(l=1;l<n;l<<=1) ;
for(int i=0;i<n;i++) update(i,1);
}
void update(int x,int d){
for(int i=x+l;i;i>>=1) a[i]+=d;
}
int getNum(int x){
int i;
for(i=1;i<l;){
i*=2;
if(a[i]<=x){
x-=a[i];
i++;
}
}
if(i-l>=n) return n;
return i-l;
}
} itr;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |