| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 761056 | vjudge1 | One-Way Streets (CEOI17_oneway) | C++17 | 315 ms | 31752 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 long long ll;
#define f(i,a,b) for(int i = a; i < b; i++)
#define fa(i,a,b) for(int i = a; i >= b; i--)
const int N = 1e5 + 5;
int n, m, q;
int U[N], V[N], col, color[N], direction[N];
bool is_bridge[N], vis[N];
int tin[N], tout[N], tim, low[N], up[N][17], pa[N], sz[N];
int st[4*N];
int head[N], co, chain[N];
int p[N], ID;
vector <int> adj[N], tree[N], curr;
void dfs(int u, int f){
tin[u] = low[u] = ++tim;
up[u][0] = pa[u] = f;
sz[u] = 1;
f(i,1,17) up[u][i] = up[up[u][i-1]][i-1];
curr.push_back(u);
int r = 0;
for(int v: adj[u]){
if(v == f) {r++; continue; }
if(tin[v] == 0){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||