# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
616918 | nghiass001 | One-Way Streets (CEOI17_oneway) | C++17 | 177 ms | 37568 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 FOR(i, l, r) for(int i=(l); i<=(r); ++i)
#define REP(i, l, r) for(int i=(l); i<(r); ++i)
#define FORD(i, r, l) for(int i=(r); i>=(l); --i)
#define REPD(i, r, l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
const int N = 1e5 + 5, M = 1e5 + 5, logN = 18, Qmax = 1e5 + 5;
int n, m, q, cnt, cnode, px[M], py[M];
int depth[N], p[N][logN], sedge[N], pre[N], parent_pair[Qmax];
int num[N], low[N], avail[N], exist[N], node[N];
vector<pii> S[N], Scc[N];
vector<int> Q, D[N], List;
char ans[M];
void Enter() {
cin >> n >> m;
FOR(i, 1, m) {
int u, v;
cin >> u >> v;
S[u].emplace_back(v, i);
S[v].emplace_back(u, -i);
}
cin >> q;
FOR(i, 1, q) cin >> px[i] >> py[i];
}
void Tarjan(int u, int pre_edge) {
num[u] = low[u] = ++cnt;
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... |