# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261216 | Bruteforceman | Examination (JOI19_examination) | C++11 | 63 ms | 5360 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;
const int maxn = 1e5 + 10;
struct info {
int x, y, z;
int id;
info (int x, int y, int z) : x(x), y(y), z(z) {}
info () {}
bool operator < (info d) const {
if(z == d.z) {
return id < d.id;
}
return z > d.z;
}
} a[maxn];
int n, idx;
int ans[maxn];
int t[maxn];
void update(int x, int val) {
for(int i = x; i <= idx; i += i & (-i)) t[i] += val;
}
int query(int x) {
int sum = 0;
for(int i = x; i > 0; i -= i & (-i)) {
sum += t[i];
}
return sum;
}
void solve(int l, int r) {
if(l == r) return ;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |