# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307903 | Hehehe | Jousting tournament (IOI12_tournament) | C++14 | 90 ms | 3576 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>
#define inbuf_len 1 << 16
#define outbuf_len 1 << 16
using namespace std;
int n, m, r, ans, M = -1, A[100010], bad[100010], sum[100010], t[400010], check[100010];
void build(int v, int l, int r){
if(l == r){
t[v] = 1;
return;
}
int m = l + r >> 1;
build(v * 2, l, m);
build(v * 2 + 1, m + 1, r);
t[v] = t[v * 2] + t[v * 2 + 1];
}
void update(int v, int l, int r, int tl, int tr){
if(r < tl || tr < l) return;
if(tl <= l && r <= tr){
t[v] = 0;
return;
}
int m = l + r >> 1;
update(v*2, l, m, tl, tr);
update(v*2 + 1, m + 1, r, tl, tr);
t[v] = t[v*2] + t[v*2 + 1];
}
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... |