# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135645 | alterio | Highway Tolls (IOI18_highway) | C++20 | 245 ms | 327680 KiB |
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
const int mxn = 9e4 + 100;
int N, M;
bool processed[mxn], mark[mxn];
int id[mxn], dep[mxn], sz[mxn];
vector<pair<int, int>> g[mxn];
vector<int> w;
int getSize(int cur, int P = -1) {
sz[cur] = !processed[cur];
for (auto to : g[cur]) {
if (to.first == P) continue;
dep[to.first] = dep[cur] + 1;
id[to.first] = to.second;
sz[cur] += getSize(to.first, cur);
}
return sz[cur];
}
void Erase(bool found) {
for (int i = 0; i < N; i++) {
if (mark[i] != found) processed[i] = 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |