# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
417244 | kai824 | Event Hopping 2 (JOI21_event2) | C++17 | 176 ms | 125556 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.
//persistent segtree with lazy propagation?!?!?!
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define eb emplace_back
#define pii pair<int,int>
#define f first
#define s second
pii vals[100005];
int lef[100005];
struct node{
int s,e,v;//range sum persistent segtree :)
node *l,*r;
node(int ss=-1,int ee=-1){
s=ss;e=ee;
v=0;l=r=NULL;
if(ss!=-1){//build whole thing for real...
if(s==e)l=r=NULL;
else{
l=new node(s,(s+e)/2);
r=new node((s+e)/2+1,e);
}
}
}
void copy(node *t){
v=t->v;
l=t->l;
# | 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... |