# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1069820 | doducanh | Regions (IOI09_regions) | C++14 | 3456 ms | 30800 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 maxn=2e5+7;
int a[maxn];
vector<int>adj[maxn];
int innode[2*maxn];
int n,r,q;
vector<int>comp[25005];
vector<vector<int>>ans;
int in[maxn];
int out[maxn];
int cnt;
void dfs(int u,int par)
{
in[u]=++cnt;
comp[a[u]].push_back(in[u]);
innode[in[u]]=u;
for(int v:adj[u])if(v!=par){
dfs(v,u);
}
out[u]=++cnt;
}
void dfs1(int u,int curr,int tmp)
{
if(a[u]==curr)tmp++;
ans[curr][a[u]]+=tmp;
for(int v:adj[u]){
dfs1(v,curr,tmp);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |