Submission #1268182


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)




int N;
set<int> E[101010], EE[101010];
//-----------------------------------------------------------------
int col[101010];
string sol() {
    queue<int> que;
    
    rep(i, 1, N + 1) if (E[i].size() == 1) que.push(i);
    while (!que.empty()) {
        int i = que.front(); que.pop();
        if (E[i].size() == 0) {
            if (col[i]) break;
            for (int j : EE[i]) if (col[j] == 2) break;
            return "First";
        }
        int j = *E[i].begin();

        if (col[i] == 0) {
            if (col[j] == 1) return "First";
            col[j] = 1;
            col[i] = 2;
        }
        
        E[j].erase(i);
        if (E[j].size() == 1) que.push(j);
    }

    return "Second";
}
//-----------------------------------------------------------------
int main() {
    cin >> N;

    if (N == 1) {
        cout << "First" << endl;
        return 0;
    }

    rep(i, 0, N - 1) {
        int a, b; scanf("%d%d", &a, &b);
        E[a].insert(b);
        E[b].insert(a);
        EE[a].insert(b);
        EE[b].insert(a);
    }

    cout << sol() << endl;
}

Submission Info

Submission Time
Task D - Black and White Tree
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 900
Code Size 1223 Byte
Status AC
Exec Time 111 ms
Memory 29056 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int a, b; scanf("%d%d", &a, &b);
                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 39
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 91 ms 29056 KB
in10.txt AC 93 ms 29056 KB
in11.txt AC 108 ms 29044 KB
in12.txt AC 11 ms 11648 KB
in13.txt AC 110 ms 29056 KB
in14.txt AC 107 ms 29044 KB
in15.txt AC 105 ms 29044 KB
in16.txt AC 107 ms 29044 KB
in17.txt AC 111 ms 29056 KB
in18.txt AC 109 ms 29044 KB
in19.txt AC 110 ms 29044 KB
in2.txt AC 94 ms 29056 KB
in20.txt AC 109 ms 29056 KB
in21.txt AC 94 ms 29056 KB
in22.txt AC 92 ms 29056 KB
in23.txt AC 89 ms 29056 KB
in24.txt AC 91 ms 29044 KB
in25.txt AC 93 ms 29044 KB
in26.txt AC 102 ms 29056 KB
in27.txt AC 96 ms 29044 KB
in28.txt AC 5 ms 9728 KB
in29.txt AC 109 ms 29044 KB
in3.txt AC 94 ms 29056 KB
in30.txt AC 108 ms 29056 KB
in31.txt AC 105 ms 29056 KB
in32.txt AC 99 ms 29056 KB
in33.txt AC 108 ms 29044 KB
in4.txt AC 94 ms 29056 KB
in5.txt AC 99 ms 29056 KB
in6.txt AC 92 ms 29056 KB
in7.txt AC 90 ms 29056 KB
in8.txt AC 91 ms 29056 KB
in9.txt AC 91 ms 29056 KB
sample1.txt AC 5 ms 9728 KB
sample2.txt AC 5 ms 9728 KB
sample3.txt AC 5 ms 9728 KB