# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971450 | andro | Examination (JOI19_examination) | C++14 | 94 ms | 18540 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 int long long
using namespace std;
const int N = 4e5 + 5;
struct fenw {
int t[N];
void add(int i, int val){
for(; i < N; i += i & - i) {
t[i] += val;
}
}
int query(int i) {
int ans = 0;
for(; i > 0; i -= i & - i) {
ans += t[i];
}
return ans;
}
int query(int l, int r) {
return query(r) - query(l - 1);
}
}fenw1, fenw2;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
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... |