Submission #1750720
Source Code Expand
#include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <vector> #include <cstring> #include <string> #include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <algorithm> using namespace std; #define REP(i,n) for(int i=0; i<n; ++i) #define FOR(i,a,b) for(int i=a; i<=b; ++i) #define FORR(i,a,b) for (int i=a; i>=b; --i) #define ALL(c) (c).begin(), (c).end() typedef long long ll; typedef vector<int> VI; typedef vector<ll> VL; typedef vector<VI> VVI; typedef vector<VL> VVL; typedef pair<int,int> P; typedef pair<ll,ll> PL; const int N = 1e5; set<int> e[N]; int main(){ int n; cin >> n; REP(i,n-1){ int u, v; scanf("%d %d", &u, &v); u--; v--; e[u].insert(v); e[v].insert(u); } VI visit(n); queue<int> que; REP(i,n){ if (e[i].size() == 1){ que.push(i); } } while (!que.empty()){ int x = que.front(); que.pop(); if (visit[x]) continue; // cout << "now" << x << endl; // REP(i,n){ // cout << i << " "; // for (int p : e[i]) cout << p << " "; // cout << endl; // } visit[x] = 1; if (e[x].size() == 0){ cout << "First" << endl; return 0; } int y = *e[x].begin(); e[x].erase(y); e[y].erase(x); visit[y] = 1; for (int z : e[y]){ e[z].erase(y); if (e[z].size() == 0){ cout << "First" << endl; return 0; } if (e[z].size() == 1 && !visit[z]){ que.push(z); } } e[y].clear(); } cout << "Second" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Black and White Tree |
User | TangentDay |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1888 Byte |
Status | AC |
Exec Time | 85 ms |
Memory | 14848 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:37:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &u, &v); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 900 | ||||
Status |
|
|
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 | 56 ms | 14848 KB |
in10.txt | AC | 52 ms | 14848 KB |
in11.txt | AC | 80 ms | 14848 KB |
in12.txt | AC | 8 ms | 5888 KB |
in13.txt | AC | 77 ms | 14848 KB |
in14.txt | AC | 63 ms | 14848 KB |
in15.txt | AC | 79 ms | 14848 KB |
in16.txt | AC | 81 ms | 14848 KB |
in17.txt | AC | 85 ms | 14848 KB |
in18.txt | AC | 74 ms | 14848 KB |
in19.txt | AC | 68 ms | 14848 KB |
in2.txt | AC | 53 ms | 14848 KB |
in20.txt | AC | 75 ms | 14848 KB |
in21.txt | AC | 52 ms | 14848 KB |
in22.txt | AC | 53 ms | 14848 KB |
in23.txt | AC | 49 ms | 14848 KB |
in24.txt | AC | 55 ms | 14848 KB |
in25.txt | AC | 63 ms | 14848 KB |
in26.txt | AC | 63 ms | 14848 KB |
in27.txt | AC | 61 ms | 14848 KB |
in28.txt | AC | 3 ms | 4992 KB |
in29.txt | AC | 83 ms | 14848 KB |
in3.txt | AC | 57 ms | 14848 KB |
in30.txt | AC | 77 ms | 14848 KB |
in31.txt | AC | 71 ms | 14848 KB |
in32.txt | AC | 68 ms | 14848 KB |
in33.txt | AC | 67 ms | 14848 KB |
in4.txt | AC | 61 ms | 14848 KB |
in5.txt | AC | 61 ms | 14848 KB |
in6.txt | AC | 64 ms | 14848 KB |
in7.txt | AC | 64 ms | 14848 KB |
in8.txt | AC | 59 ms | 14848 KB |
in9.txt | AC | 59 ms | 14848 KB |
sample1.txt | AC | 3 ms | 4992 KB |
sample2.txt | AC | 3 ms | 4992 KB |
sample3.txt | AC | 3 ms | 4992 KB |