Submission #1610734
Source Code Expand
#include <cstdio> #include <vector> using namespace std; #define iter(i, n) for (int i = 1; i <= n; ++i) #define NR 101000 int n; vector<int> g[NR]; bool ans = true; bool dfs(int x, int fa) { bool need = true; for (int v : g[x]) if (v != fa) { if (dfs(v, x)) { if (need) need = false; else ans = false; } } return need; } int main() { scanf("%d", &n); iter(i, n - 1) { int x, y; scanf("%d%d", &x, &y); g[x].push_back(y); g[y].push_back(x); } printf("%s\n", (dfs(1, 0) || !ans) ? "First" : "Second"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Black and White Tree |
User | Ketsui |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 576 Byte |
Status | AC |
Exec Time | 46 ms |
Memory | 5888 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:24:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:27:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &x, &y); ^
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 | 41 ms | 5888 KB |
in10.txt | AC | 42 ms | 5888 KB |
in11.txt | AC | 40 ms | 5760 KB |
in12.txt | AC | 6 ms | 2944 KB |
in13.txt | AC | 41 ms | 5760 KB |
in14.txt | AC | 45 ms | 5760 KB |
in15.txt | AC | 39 ms | 5760 KB |
in16.txt | AC | 46 ms | 5760 KB |
in17.txt | AC | 42 ms | 5760 KB |
in18.txt | AC | 39 ms | 5760 KB |
in19.txt | AC | 40 ms | 5760 KB |
in2.txt | AC | 42 ms | 5888 KB |
in20.txt | AC | 39 ms | 5760 KB |
in21.txt | AC | 39 ms | 5888 KB |
in22.txt | AC | 39 ms | 5888 KB |
in23.txt | AC | 39 ms | 5760 KB |
in24.txt | AC | 43 ms | 5760 KB |
in25.txt | AC | 39 ms | 5760 KB |
in26.txt | AC | 39 ms | 5760 KB |
in27.txt | AC | 39 ms | 5760 KB |
in28.txt | AC | 3 ms | 2560 KB |
in29.txt | AC | 40 ms | 5760 KB |
in3.txt | AC | 39 ms | 5888 KB |
in30.txt | AC | 38 ms | 5760 KB |
in31.txt | AC | 41 ms | 5760 KB |
in32.txt | AC | 39 ms | 5760 KB |
in33.txt | AC | 39 ms | 5760 KB |
in4.txt | AC | 39 ms | 5888 KB |
in5.txt | AC | 39 ms | 5888 KB |
in6.txt | AC | 39 ms | 5888 KB |
in7.txt | AC | 39 ms | 5888 KB |
in8.txt | AC | 38 ms | 5888 KB |
in9.txt | AC | 39 ms | 5888 KB |
sample1.txt | AC | 3 ms | 2560 KB |
sample2.txt | AC | 3 ms | 2560 KB |
sample3.txt | AC | 3 ms | 2560 KB |