# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
372768 | ngpin04 | Regions (IOI09_regions) | C++14 | 5128 ms | 131076 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 N = 2e5 + 5;
const int S = sqrt(N);
map <int, int> ans[N];
vector <int> adj[N];
vector <int> id[N];
int grp[N];
int tin[N];
int tout[N];
int sum[N];
int n,m,q,cntdfs;
void dfs(int u = 1) {
tin[u] = ++cntdfs;
for (int v : adj[u])
dfs(v);
tout[u] = cntdfs;
}
void calc(int idgrp) {
for (int i = 1; i <= n; i++)
sum[i] = 0;
for (int i : id[idgrp])
sum[tin[i]]++, sum[tout[i] + 1]--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |