# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787379 | boyliguanhan | 늑대인간 (IOI18_werewolf) | C++17 | 1808 ms | 272768 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 "werewolf.h"
#define pb push_back
#define VI vector<int>
#include<bits/stdc++.h>
using namespace std;
#define MXN 400100
struct node{
int l,r,val,lc,rc;
node():l(0){}
node(int l, int r, int val, int lc, int rc):l(l),r(r),val(val),lc(lc),rc(rc){}
node(int pos):l(pos),r(pos),val(1){}
} t[15*MXN];
int cnt;
int query(int i, int l, int r) {
if(!t[i].val||t[i].l>r||t[i].r<l)return 0;
if(l<=t[i].l&&t[i].r<=r) return t[i].val;
return query(t[i].lc,l,r)+query(t[i].rc,l,r);
}
int mn(int a, int b) {
t[++cnt] = node(t[a].l,t[b].r,t[a].val+t[b].val,a,b);
return cnt;
}
int upd(int i, int pos) {
if(t[i].l==t[i].r) {
t[++cnt] = node(pos);
return cnt;
}
if(pos<t[t[i].rc].l)
return mn(upd(t[i].lc,pos),t[i].rc);
return mn(t[i].lc, upd(t[i].rc, pos));
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... |