# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242229 | tqbfjotld | Jousting tournament (IOI12_tournament) | C++14 | 36 ms | 16632 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 <bits/stdc++.h>
using namespace std;
pair<int,int> actual[100005];
int fenwick[100005];
int qu(int p){
p++;
int ans = 0;
while (p>0){
ans += fenwick[p];
p-= (p&-p);
}
return ans;
}
void upd(int p, int v){
p++;
while (p<100005){
fenwick[p] += v;
p += (p&-p);
}
}
bool cmp(pair<int,int> a, pair<int,int> b){
if (a.first==b.first) return a.second>b.second;
return a.first<b.first;
}
vector<int> adjl[100005];
int ranks[100005];
int k;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |