Submission #305132

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
305132	2020-09-22 15:42:40	miss_robot	One-Way Streets (CEOI17_oneway)	C++14	100 / 100	326 ms	40056 KiB

oneway

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 1e5+1, L = 17;
int n, m, q, c;
int num[N], low[N], bridge[N], p[L][N], up[N], dir[N], in[N], out[N], height[N];
pair<int, int> e[N];
vector<int> g[N], ind[N];
vector<int> h[N], dni[N];
char sol[N];
void dfs(int u, int l){
  num[u] = low[u] = ++c;
  for(int i = 0, v, x; i < (int)g[u].size(); i++){
    v = g[u][i], x = ind[u][i];
    if(!num[v]){
      dfs(v, x);
      if(low[v] > num[u]) bridge[x] = 1;
      low[u] = min(low[u], low[v]);
    }
    if(x != l) low[u] = min(low[u], num[v]);
  }
}
void fnd(int u){
  if(num[u]) return;
  num[u] = c;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40