Submission #476355

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
476355	2021-09-26 07:22:38	cgiosy	One-Way Streets (CEOI17_oneway)	C++17	100 / 100	64 ms	11588 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>
using namespace std;
int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  int N, M, Q;
  cin>>N>>M;
  int E[M*2+2], F[M*2+2], G[N]{};
  for(int i=1; i<=M; i++) {
    int a, b;
    cin>>a>>b; --a, --b;
    E[i*2]=b, F[i*2]=G[a], G[a]=i*2;
    E[i*2+1]=a, F[i*2+1]=G[b], G[b]=i*2+1;
  }
  int A[N]{}, T[N], P[N], t=0;
  char V[max(N, M)+1]{};
  function<int(int)> root=[&](int i) {
    return P[i]>=0 ? P[i]=root(P[i]) : i;
  };
  auto up=[&](int&i) { i=P[i]=root(~P[i]); };
  function<void(int, int)> bcc=[&](int i, int p) {
    A[i]=T[i]=++t;
    for(int e=G[i]; e; e=F[e]) if(e!=p) {
      int&j=E[e];
      if(A[j]) { T[i]=min(T[i], A[j]); continue; }
      V[e>>1]=e&1, P[j]=~i;
      bcc(j, e^1);
      T[i]=min(T[i], T[j]);
      if(A[i]<T[j]) V[e>>1]|=2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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