Submission #2119248
Source Code Expand
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 19;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<n;i++)
#define Se second
#define Fi first
const int MX = 200005;
const int MM = 1000000007;
int N, M;
int D[MX], E[MX];
vector<int> G[MX];
void dfs(int x, int p, int D[MX]){
D[x] = D[p] + 1;
for(int c : G[x]){
if( c == p ) continue;
dfs(c, x, D);
}
}
int main()
{
scanf("%d", &N);
for(int i = 1; i < N; i++){
int a, b;
scanf("%d%d", &a, &b);
G[a].push_back(b);
G[b].push_back(a);
}
dfs(1, 0, D);
dfs(N, 0, E);
int ans = 0;
for(int i = 1; i <= N; i++){
ans += D[i] <= E[i] ? 1 : -1;
}
if( ans >= 1 ) printf("Fennec\n");
else printf("Snuke\n");
}
Submission Info
Submission Time |
|
Task |
D - Fennec VS. Snuke |
User |
zigui |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1703 Byte |
Status |
AC |
Exec Time |
50 ms |
Memory |
14208 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:70:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
./Main.cpp:73:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &a, &b);
^
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 |
3 ms |
6400 KB |
00_example_02.txt |
AC |
3 ms |
6400 KB |
01.txt |
AC |
3 ms |
6400 KB |
02.txt |
AC |
3 ms |
6400 KB |
03.txt |
AC |
3 ms |
6400 KB |
04.txt |
AC |
3 ms |
6400 KB |
05.txt |
AC |
36 ms |
10240 KB |
06.txt |
AC |
38 ms |
10496 KB |
07.txt |
AC |
35 ms |
10240 KB |
08.txt |
AC |
38 ms |
10368 KB |
09.txt |
AC |
3 ms |
6400 KB |
10.txt |
AC |
33 ms |
9216 KB |
11.txt |
AC |
38 ms |
9216 KB |
12.txt |
AC |
50 ms |
9472 KB |
13.txt |
AC |
37 ms |
9600 KB |
14.txt |
AC |
38 ms |
9600 KB |
15.txt |
AC |
37 ms |
9600 KB |
16.txt |
AC |
41 ms |
14208 KB |
17.txt |
AC |
41 ms |
14208 KB |
18.txt |
AC |
41 ms |
14208 KB |
19.txt |
AC |
41 ms |
14208 KB |