# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29312 | tlwpdus | Meteors (POI11_met) | C++11 | 3383 ms | 38588 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 s first
#define e second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n, m, k;
struct query {
int l, r; ll a;
query(){}
query(int l, int r, ll a):l(l),r(r),a(a){}
};
struct idxtree {
ll tree[1050000];
int key = 524288;
void init() {
for (int i=0;i<key*2;i++) tree[i] = 0;
}
void updr(int s, int e, ll val) {
s+=key;e+=key;
while(s<=e) {
if (s&1) tree[s] += val;
if (~e&1) tree[e] += val;
s = (s+1)>>1; e = (e-1)>>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... |
# | 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... |