# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67537 | MiricaMatei | One-Way Streets (CEOI17_oneway) | C++14 | 798 ms | 55052 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 <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000;
struct Edge {
int a, b;
int other(int node) {
return a ^ b ^ node;
}
}e[MAX_N + 5];
vector<int>G[MAX_N + 5];
int h[MAX_N + 5], low[MAX_N + 5];
bool viz[MAX_N + 5];
int t1[MAX_N + 5], h1[MAX_N + 5];
int indcomp[MAX_N + 5];
vector<int>comp[MAX_N + 5];
vector<int>G1[MAX_N + 5];
int t2[MAX_N + 5], h2[MAX_N + 5];
int niv[MAX_N + 5], f[MAX_N + 5];
int mp[MAX_N + 5], nd[MAX_N + 5];
char sol[MAX_N + 5];
int f1(int x) {
int y = x;
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... |