# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328664 | jovan_b | Examination (JOI19_examination) | C++17 | 859 ms | 48604 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 long long ll;
struct BIT{
int n;
int val[1000000];
int get(int x){
int res = 0;
while(x){
res += val[x];
x -= x & -x;
}
return res;
}
void add(int x, int vrd){
while(x <= n){
val[x] += vrd;
x += x & -x;
}
}
};
struct query{
int x, y, z, ind;
};
bool cmp1(query a, query b){
if(a.x == b.x) return a.ind > b.ind;
# | 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... |