# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496083 | mosiashvililuka | Regions (IOI09_regions) | C++14 | 2739 ms | 39772 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;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,f[200009],k[630],T=320,K[25009],F[25009],TT,lf[200009],rg[200009],tim,C,D,lef,rig,mid;
long long ans[630][25002],ZX;
vector <int> v[200009];
vector <pair <int, int> > vv[200009];
void dfs(int q, int w){
tim++;
lf[q]=rg[q]=tim;
int qw=vv[f[q]].size();
vv[f[q]].push_back(make_pair(lf[q],0));
for(int h=1; h<=TT; h++){
ans[h][f[q]]+=k[h];
}
if(F[f[q]]!=0) k[F[f[q]]]++;
for(vector <int>::iterator it=v[q].begin(); it!=v[q].end(); it++){
if((*it)==w) continue;
dfs((*it),q);
if(rg[q]<rg[(*it)]) rg[q]=rg[(*it)];
}
vv[f[q]][qw].second=rg[q];
if(F[f[q]]!=0) k[F[f[q]]]--;
}
int main(){
ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>a>>zx>>tes;
cin>>f[1];
for(i=2; i<=a; i++){
cin>>c>>f[i];
v[c].push_back(i);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |