# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
897027 | codefox | One-Way Streets (CEOI17_oneway) | C++14 | 122 ms | 20444 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;
#define pii pair<int, int>
#define s second
#define f first
vector<vector<pii>> graph;
vector<vector<pii>> cgraph;
vector<int> comp;
vector<int> low;
vector<int> num;
vector<bool> used;
vector<int> start;
vector<int> ende;
vector<int> dir;
vector<bool> vis;
stack<int> s;
int c = 0;
int d = 0;
void bicc(int i)
{
vis[i] = true;
low[i] = num[i] = c++;
s.push(i);
for (pii ele: graph[i])
{
if (used[ele.s]) continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |