제출 #37201

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
37201	2017-12-22 14:04:23	aome	007 (CEOI14_007)	C++14	100 / 100	366 ms	19956 KiB

007

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;
const int N = 200005;
const int INF = 1e9;
int n, m;
int p0, p1, a[2];
int dis[2][N];
int f[N], dis2[N];
bool lose[N];
vector<int> G[N];
void bfs(int t) {
  for (int i = 1; i <= n; ++i) dis[t][i] = INF;
  queue<int> qu; dis[t][a[t]] = 0, qu.push(a[t]);
  while (qu.size()) {
    int u = qu.front(); qu.pop();
    for (auto v : G[u]) {
      if (dis[t][v] == INF) {
        dis[t][v] = dis[t][u] + 1, qu.push(v);
      }
    }
  }
}
void dfs(int u) {
  f[u] = 1;
  for (auto v : G[u]) {
    if (dis[0][v] + 1 != dis[0][u] || dis[1][v] + 1 != dis[1][u]) continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70