# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738959 | lorenzoferrari | Regions (IOI09_regions) | C++17 | 2326 ms | 45136 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.
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
static constexpr int N = 200000;
static constexpr int R = 25000;
static constexpr int SQ = 700;
static int h[N], p[N], f[R], in[N], out[N];
static vector<int> fi(R, -1), ff;
static vector<int> adj[N];
static vector<array<int, 2>> ev[R];
static vector<array<int, 2>> vs[R];
vector<vector<LL>> sub, anc;
int t = 0;
static void dfs0(int v) {
in[v] = t++;
for (int u : adj[v]) {
dfs0(u);
}
out[v] = t;
}
static int dfs1(int v, const int i, int acc = 0) {
int cnt = 0;
for (int u : adj[v]) {
cnt += dfs1(u, i, acc + (h[v] == ff[i]));
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |