# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230699 | AlexLuchianov | One-Way Streets (CEOI17_oneway) | C++14 | 393 ms | 34940 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 <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <set>
using namespace std;
int const nmax = 100000;
int const lgmax = 20;
vector<int> g[1 + nmax];
int edge[1 + nmax][2];
int level[1 + nmax], seen[1 + nmax];
int maxlevel[1 + nmax], comp[1 + nmax];
void dfs(int node, int parent){
level[node] = level[parent] + 1;
maxlevel[node] = level[node];
seen[node] = 1;
int skipped = 0;
for(int h = 0; h < g[node].size(); h++){
int to = g[node][h];
if(to == parent && skipped == 0){
skipped++;
continue;
}
if(seen[to] == 0) {
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... |