# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532832 | amunduzbaev | Fire (JOI20_ho_t5) | C++17 | 380 ms | 46024 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;
#define ar array
#define int long long
const int N = 2e5 + 5;
struct ST{
int tree[N];
void add(int i, int v){
i++;
for(;i<N;i+=(i&-i)) tree[i] += v;
}
void add(int l, int r, int v){
add(l, v);
add(r + 1, -v);
}
int get(int i){
i++;
int r=0;
for(;i>0;i-=(i&-i)) r += tree[i];
return r;
}
}tree, cnt;
int s[N], t[N], L[N], R[N];
int l[N], r[N], res[N];
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |