# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390287 | mchang | One-Way Streets (CEOI17_oneway) | C++11 | 112 ms | 19496 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.
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
vector<pii> adj[1<<18];
char dir[1<<18];
vector<pii> edges;
int pre[1<<18];
int link[1<<18];
int prenum = 1;
int N,M,P;
int indeg[1<<18];
int outdeg[1<<18];
void dfs(int u, int pi) {
pre[u] = link[u] = prenum++;
int minlink = pre[u];
for (auto& e : adj[u]) {
if (e.S == pi) continue;
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... |