# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73831 | FLDutchman | Jousting tournament (IOI12_tournament) | C++14 | 1069 ms | 4916 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;
typedef int INT;
#define pb push_back
#define fst first
#define snd second
#define FOR(i,l,r) for(int i = (l); i < (r); i++)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
void prop(int,int,int);
vi tsum, tmax, lazy;
vi arr;
void upds(int n){
tsum[n] = tsum[n<<1] + tsum[n<<1|1];
}
void buildsum(int lb, int rb, int n){
if(lb+1==rb) {
tsum[n] = 1;
return;
}
int mb = (lb+rb)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |