# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158580 | Lawliet | One-Way Streets (CEOI17_oneway) | C++14 | 167 ms | 23316 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 MAXN = 100010;
int n, m, q;
int curTime;
int ans[MAXN];
int low[MAXN];
int pre[MAXN];
int sub[MAXN];
bool marc[MAXN];
vector< int > adj[MAXN];
vector< int > indEdge[MAXN];
vector< int > direction[MAXN];
int min(int& a, int& b)
{
if(a < b) return a;
return b;
}
void DFSLowlink(int cur, int p)
{
marc[ cur ] = true;
low[ cur ] = pre[ cur ] = ++curTime;
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... |