# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169040 | AlexLuchianov | Race (IOI11_race) | C++14 | 687 ms | 34040 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 "race.h"
#include <vector>
#include <iostream>
#include <algorithm>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 200000;
int const kmax = 1000000;
struct Edge{
int to;
int cost;
};
std::vector<Edge> g[1 + nmax];
int sz[1 + nmax], seen[1 + nmax];
void dfs(int node, int parent){
sz[node] = 1;
for(int h = 0; h < g[node].size(); h++){
Edge e = g[node][h];
if(seen[e.to] == 0 && e.to != parent){
dfs(e.to, node);
sz[node] += sz[e.to];
}
}
Compilation message (stderr)
# | 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... |