# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167304 | turneja | Race (IOI11_race) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(nullptr);
const int N = 2e5 + 5;
int sz[N];
bool seen_c[N];
int parent_c[N];
int depth[N];
long long path[N];
vector<pair<int, int>> adj[N];
map<long long, int> mp;
int ans = N;
void dfs_subtree(int u, int p) {
sz[u] = 1;
for (auto [v, wt] : adj[u]) {
if (v != p && !seen_c[v]) {
dfs_subtree(v, u);
sz[u] += sz[v];
}
}