# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116083 | Meloric | One-Way Streets (CEOI17_oneway) | C++14 | 233 ms | 15860 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 pb push_back
#define X first
#define Y second
#define pii pair<int, int>
using namespace std;
vector<vector<int>> g;
struct edge{
int u, v;
char dir;
};
vector<edge> ed;
vector<int> tin, low, val, vis;
int n, m, counter;
void dfs(int v, int p){
tin[v] = low[v] = counter;
counter++;
vis[v] = 1;
for(auto ch : g[v]){
if(ch == p)continue;
int nx = (v==ed[ch].u) ? ed[ch].v : ed[ch].u;
if(vis[nx]){
low[v] = min(low[v], tin[nx]);
continue;
}
dfs(nx, ch);
low[v] = min(low[v], low[nx]);
pii cor;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |