Submission #1752631
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <vector> using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int, int> PII; typedef vector<int> VI; #define fi first #define se second #define MP make_pair int read() { int v = 0, f = 1; char c = getchar(); while (c < 48 || 57 < c) {if (c == '-') f = -1; c = getchar();} while (48 <= c && c <= 57) v = (v << 3) + v + v + c - 48, c = getchar(); return v * f; } const int N = 1e5 + 10; int f[N], g[N], head[N], en, n; struct Edge { int nxt, to; } eg[N << 1]; void setEdge(int u, int v) { eg[++en] = (Edge) {head[u], v}; head[u] = en; } void dfs(int u, int fa) { int t = 0; for (int e = head[u]; e; e = eg[e].nxt) { int v = eg[e].to; if (v == fa) continue; dfs(v, u); if (f[v]) continue; if (!g[v]) { f[u] = g[u] = 0; return ; } t++; } if (t > 1) f[u] = g[u] = 0; if (t == 1) f[u] = 1, g[u] = 0; if (t == 0) f[u] = 0, g[u] = 1; } int main() { n = read(); for (int i = 1; i < n; i++) { int u = read(), v = read(); setEdge(u, v); setEdge(v, u); } dfs(1, 0); if (f[1]) puts("Second"); else puts("First"); }
Submission Info
Submission Time | |
---|---|
Task | D - Black and White Tree |
User | Misaka10032 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 1563 Byte |
Status | AC |
Exec Time | 16 ms |
Memory | 2944 KB |
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 | 11 ms | 2304 KB |
in10.txt | AC | 11 ms | 2304 KB |
in11.txt | AC | 16 ms | 2944 KB |
in12.txt | AC | 2 ms | 512 KB |
in13.txt | AC | 15 ms | 2944 KB |
in14.txt | AC | 16 ms | 2944 KB |
in15.txt | AC | 15 ms | 2944 KB |
in16.txt | AC | 16 ms | 2944 KB |
in17.txt | AC | 16 ms | 2944 KB |
in18.txt | AC | 16 ms | 2944 KB |
in19.txt | AC | 16 ms | 2944 KB |
in2.txt | AC | 11 ms | 2304 KB |
in20.txt | AC | 16 ms | 2944 KB |
in21.txt | AC | 11 ms | 2304 KB |
in22.txt | AC | 11 ms | 2304 KB |
in23.txt | AC | 12 ms | 2944 KB |
in24.txt | AC | 12 ms | 2944 KB |
in25.txt | AC | 12 ms | 2944 KB |
in26.txt | AC | 13 ms | 2944 KB |
in27.txt | AC | 12 ms | 2944 KB |
in28.txt | AC | 1 ms | 256 KB |
in29.txt | AC | 16 ms | 2944 KB |
in3.txt | AC | 11 ms | 2304 KB |
in30.txt | AC | 16 ms | 2944 KB |
in31.txt | AC | 12 ms | 2944 KB |
in32.txt | AC | 12 ms | 2944 KB |
in33.txt | AC | 14 ms | 2944 KB |
in4.txt | AC | 11 ms | 2304 KB |
in5.txt | AC | 11 ms | 2304 KB |
in6.txt | AC | 11 ms | 2304 KB |
in7.txt | AC | 12 ms | 2304 KB |
in8.txt | AC | 11 ms | 2304 KB |
in9.txt | AC | 11 ms | 2304 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |