# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197447 | quocnguyen1012 | One-Way Streets (CEOI17_oneway) | C++14 | 363 ms | 34860 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>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task "ONEWAY"
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int nTime=0;
vector <int> adj[maxn];
int Visited[maxn], Low[maxn], Parent[maxn];
int U[maxn], V[maxn];
int N, M, P;
int st[maxn], en[maxn];
bool Bridge[maxn];
bool minimize(int &a, int b){
if (a>b) a=b;
else return false;
return true;
}
void visit(int u){
///cerr << u << ' ' << Parent[u] << '\n';
Low[u] = Visited[u] = ++nTime;
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... |