# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116142 | luciocf | Regions (IOI09_regions) | C++14 | 1254 ms | 53624 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+10;
const int maxr = 510;
typedef long long ll;
int n, R, q;
int region[maxn];
ll ans[maxr][maxr];
vector<int> grafo[maxn];
int dfs(int u, int p, int r)
{
int qtd = 0;
if (region[u] == r)
qtd = 1;
for (auto v: grafo[u])
{
if (v == p) continue;
qtd += dfs(v, u, r);
}
ans[region[u]][r] += 1ll*qtd;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |