# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397157 | keta_tsimakuridze | Synchronization (JOI13_synchronization) | C++14 | 491 ms | 29592 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 f first
#define int long long
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,cnt[N],pos[N],ind[N],cur,n,m,q,u[N],v[N],bef[N],par[N],sz[N],st[N],ch[N],idx,f[N];
vector<int>V[N];
pair<int,int> tree[4*N];
string s;
void update(int u,int ind,int l,int r,int val){
if(l>ind || r<ind) return;
if(l==r) {
tree[u]={val,l};
return;
}
int mid=(l+r)/2;
update(2*u,ind,l,mid,val);
update(2*u+1,ind,mid+1,r,val);
tree[u]=max(tree[2*u],tree[2*u+1]);
}
pair<int,int> getans(int u,int start,int end,int l,int r){
if(l>end || r<start) return {0,0};
if(start<=l && r<=end) return tree[u];
int mid=(l+r)/2;
return max( getans(2*u,start,end,l,mid),getans(2*u+1,start,end,mid+1,r) );
}
void get_sz(int u,int p){
sz[u] = 1;
cnt[u] = 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... |