# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003760 | coolboy19521 | One-Way Streets (CEOI17_oneway) | C++17 | 162 ms | 61188 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.
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int sz = 2e5 + 10;
const int sm = 25;
vector<pair<int, int>> aj[sz], ajgr[sz];
int br[sz], gr[sz], dp[sz];
int in[sz], lo[sz];
int pn[sz], pe[sz];
int le[sz], ri[sz];
int up[sm][sz];
int n, m, p;
bool dr[sz];
char la[sz];
int tr;
void taj(int v, int p = 0) {
in[v] = lo[v] = ++tr;
bool ps = false;
for (auto& u : aj[v]) {
int to = u.first, nm = u.second;
if (to == p && !ps) {
ps = true;
continue;
} else if (in[to]) {
lo[v] = min(lo[v], in[to]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |