# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103834 | luciocf | One-Way Streets (CEOI17_oneway) | C++14 | 386 ms | 28792 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.
// CEOI 2017 - One-Way Streets
// Lúcio Cardoso
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
const int maxl = 20;
const int inf = 1e9+10;
typedef pair<int, int> pii;
int n, m;
int in[maxn], low[maxn], tt;
int comp[maxn], bcc;
int pai[maxn], nivel[maxn];
int tab[maxn][maxl];
int menor[2][maxn];
int ans[maxn];
bool bridge[maxn], mark[maxn];
vector<pair<int, pii>> grafo[maxn], tree[maxn];
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... |