Submission #1872575


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;

vector<int> vp[100001];
int dd1[100001],dd2[100001];
int d1=0,d2=0;
bool used[100001];
int main(){
    int n,sr,ds;
    cin>>n;
    rep(i,n-1){
        cin>>sr>>ds;
        vp[sr-1].pb(ds-1);
        vp[ds-1].pb(sr-1);
    }
    queue<pint> q;
    q.push(mp(0,0));
    used[0]=true;
    while(!q.empty()){
        pint pi=q.front();q.pop();
        int cur=pi.first;
        dd1[cur]=pi.second;
        rep(i,vp[cur].size()){
            if(!used[vp[cur][i]]){
                q.push(mp(vp[cur][i],pi.second+1));
                used[vp[cur][i]]=true;
            }
        }
    }
    memset(used,0,sizeof(used));
    q.push(mp(n-1,0));
    used[n-1]=true;
    while(!q.empty()){
        pint pi=q.front();q.pop();
        int cur=pi.first;
        dd2[cur]=pi.second;
        rep(i,vp[cur].size()){
            if(!used[vp[cur][i]]){
                q.push(mp(vp[cur][i],pi.second+1));
                used[vp[cur][i]]=true;
            }
        }
    }
    int cnt1=0,cnt2=0;
    rep(i,n){
        if(dd1[i]<=dd2[i]) ++cnt1;
        else ++cnt2;
    }
    if(cnt1>=cnt2) cout<<"Fennec"<<endl;
    else cout<<"Snuke"<<endl;
    return 0;
}

Submission Info

Submission Time
Task D - Fennec VS. Snuke
User ts_
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1412 Byte
Status WA
Exec Time 84 ms
Memory 6784 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 14
WA × 7
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 2688 KB
00_example_02.txt AC 3 ms 2688 KB
01.txt WA 3 ms 2688 KB
02.txt AC 3 ms 2688 KB
03.txt AC 3 ms 2688 KB
04.txt AC 3 ms 2688 KB
05.txt AC 71 ms 6016 KB
06.txt WA 76 ms 6144 KB
07.txt AC 70 ms 6016 KB
08.txt AC 78 ms 6144 KB
09.txt WA 3 ms 2688 KB
10.txt AC 70 ms 6272 KB
11.txt AC 77 ms 6272 KB
12.txt AC 76 ms 6656 KB
13.txt AC 81 ms 6784 KB
14.txt AC 80 ms 6784 KB
15.txt AC 79 ms 6784 KB
16.txt WA 82 ms 6528 KB
17.txt WA 82 ms 6656 KB
18.txt WA 84 ms 6656 KB
19.txt WA 82 ms 6656 KB