Submission #3239679
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef struct{ int i; int cnt; } Data; int main(){ int n; cin >> n; vector<int> graph[100010]; int a,b; for(int i = 0;i < n-1;i++){ cin >> a >> b; a--; b--; graph[a].push_back(b); graph[b].push_back(a); } int memo[100010] = {}; memo[0] = 1; memo[n-1] = 2; queue<Data> que1,que2; Data d; d.i = 0; d.cnt = 0; que1.push(d); d.i = n-1; que2.push(d); int c = 0; while(!que1.empty() || !que2.empty()){ while(!que1.empty()){ Data tmp = que1.front(); if(tmp.cnt != c){ break; } que1.pop(); if(memo[tmp.i] == 0 || c == 0){ memo[tmp.i] = 1; for(int i = 0;i < graph[tmp.i].size();i++){ if(memo[graph[tmp.i][i]] == 0){ Data t2; t2.i = graph[tmp.i][i]; t2.cnt = c+1; que1.push(t2); } } } } while(!que2.empty()){ Data tmp = que2.front(); if(tmp.cnt != c){ break; } que2.pop(); if(memo[tmp.i] == 0 || c == 0){ memo[tmp.i] = 2; tmp.cnt; for(int i = 0;i < graph[tmp.i].size();i++){ if(memo[graph[tmp.i][i]] == 0){ Data t2; t2.i = graph[tmp.i][i]; que2.push(t2); } } } } c++; } a = b = 0; for(int i = 0;i < n;i++){ if(memo[i] == 1){ a++; }else if(memo[i] == 2){ b++; } } if(a > b){ cout << "Fennec" << endl; }else{ cout << "Snuke" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Fennec VS. Snuke |
User | yta_smh17 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1663 Byte |
Status | AC |
Exec Time | 74 ms |
Memory | 6400 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 2 ms | 2944 KB |
00_example_02.txt | AC | 2 ms | 2944 KB |
01.txt | AC | 2 ms | 2944 KB |
02.txt | AC | 2 ms | 2944 KB |
03.txt | AC | 2 ms | 2944 KB |
04.txt | AC | 2 ms | 2944 KB |
05.txt | AC | 63 ms | 5632 KB |
06.txt | AC | 68 ms | 5760 KB |
07.txt | AC | 61 ms | 5632 KB |
08.txt | AC | 68 ms | 5760 KB |
09.txt | AC | 2 ms | 2944 KB |
10.txt | AC | 60 ms | 6016 KB |
11.txt | AC | 68 ms | 5888 KB |
12.txt | AC | 69 ms | 6144 KB |
13.txt | AC | 72 ms | 6400 KB |
14.txt | AC | 69 ms | 6400 KB |
15.txt | AC | 72 ms | 6400 KB |
16.txt | AC | 74 ms | 6144 KB |
17.txt | AC | 74 ms | 6144 KB |
18.txt | AC | 74 ms | 6144 KB |
19.txt | AC | 72 ms | 6144 KB |