# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
377846 | astoria | 역사적 조사 (JOI14_historical) | C++14 | 4026 ms | 130028 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 N=1e5+5,Q=1e5+5;
const int S = 600;
struct Query{
int l,r,p,bk;
};
Query qr[Q];
int n,q,x[N];
struct node{
int s,e,m; long long val;
node *l, *r;
node(int _s, int _e){
s=_s; e=_e;
m=(s+e)>>1;
val = 0;
}
void create(){
if(s!=e){
l=new node(s,m);
r=new node(m+1,e);
}
}
void upd(int p, int v){
if(s==e) val += (long long) v;
else{
# | 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... |