Submission #37163

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
37163	2017-12-21 16:58:34	cheater2k	007 (CEOI14_007)	C++14	100 / 100	339 ms	18956 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;
int n, m, s, d, a, b;
vector<int> G[N];
int fa[N], fb[N];
void bfs(int start, int f[]) {
  for (int i = 1; i <= n; ++i) f[i] = -1;
  f[start] = 0;
  queue <int> q; q.push(start);
  while(!q.empty()) {
    int u = q.front(); q.pop();
    for (int v : G[u]) if (f[v] == -1) {
      f[v] = f[u] + 1; q.push(v);
    }
  }
}
int maxdep(int start) {
  vector<int> d(n + 1, -1);
  queue <int> q; q.push(start); d[start] = 0;
  int ans = 0;
  while(!q.empty()) {
    int u = q.front(); q.pop();
    ans = max(ans, d[u]);
    for (int v : G[u]) if (fa[v] == fa[u] - 1 && fb[v] == fb[u] - 1 && d[v] == -1) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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