# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56067 | gabrielsimoes | One-Way Streets (CEOI17_oneway) | C++17 | 1996 ms | 33732 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;
typedef pair<int,int> pii;
const int MAXN = 1e5+10, MAXL = 18;
int n, m, p;
vector<pii> edges;
vector<pii> requirements;
vector<int> gix[MAXN];
bool isFirst(int cur, int edge) {
return cur == edges[edge].first;
}
int other(int cur, int edge) {
if (isFirst(cur, edge)) return edges[edge].second;
else return edges[edge].first;
}
bool isPartOfCycle[MAXN];
bool edgeUsed[MAXN];
int status[MAXN];
vector<pii> stk;
void dfsCycles(int cur, int inIx) {
status[cur] = 1;
stk.push_back({cur, inIx});
for (int ix : gix[cur]) {
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... |