# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176141 | arwakhattab | Race (IOI11_race) | C++20 | 798 ms | 37936 KiB |
#include "race.h"
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const char nl = '\n', sp = ' ';
const int inf = 1e9;
struct centroid_decomposition {
int n, w;
int ans = inf;
vector<vector<pair<int, int> > > g;
vector<int> sz;
vector<bool> is_removed;
map<ll, int> mp;
centroid_decomposition(int n) : n(n) {
g.assign(n, {});
sz.assign(n, 0);
is_removed.assign(n, false);
}
void add_edge(int u, int v, int c) {
g[u].emplace_back(v, c);
g[v].emplace_back(u, c);
}
int get_size(int u, int p) {
sz[u] = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |