Submission #4130047
Source Code Expand
#include<stdio.h> #include<iostream> #include<vector> #include<algorithm> #include<string> #include<string.h> using namespace std; typedef long long LL; typedef vector<int> VI; #define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i) #define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i) #define eprintf(...) fprintf(stderr, __VA_ARGS__) template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; } template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; } template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) { for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); } putchar('\n'); } int N; VI G[100011]; VI X[100011]; int par[100011]; VI ord; int U[100011]; void MAIN() { scanf("%d", &N); REP (i, N-1) { int x, y; scanf("%d%d", &x, &y); x--; y--; G[x].push_back(y); G[y].push_back(x); } ord.reserve(N); ord.push_back(0); REP (i_, N) { int v = ord[i_]; EACH (e, G[v]) if (*e != par[v]) { par[*e] = v; ord.push_back(*e); } } VI buf; buf.reserve(N+2); REP (i_, N) { int v = ord[N-1-i_]; int cnt = 0, ma = -1; VI g; EACH (e, G[v]) if (*e != par[v]) { g.push_back(X[*e].back()); if (ma < X[*e].back()) { ma = X[*e].back(); cnt = 0; } if (ma == X[*e].back()) { cnt++; } } if (cnt == 0) { U[v] = 0; X[v].push_back(0); } else { buf.resize(ma+2); fill(buf.begin(), buf.end(), 0); EACH (e, G[v]) if (*e != par[v]) { EACH (f, X[*e]) buf[*f] = 1; buf[U[*e]]++; } REP (i, ma+2) { if (buf[i] == 0) { buf[i] = 1; U[v] = i; break; } else { buf[i] = 0; } } REP (i, ma+2) if (buf[i]) X[v].push_back(i); } } int ma = *max_element(U, U+N); //rprintf("%d", U, U+N); printf("%d\n", ma); } int main() { int TC = 1; // scanf("%d", &TC); REP (tc, TC) MAIN(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Uninity |
User | natsugiri |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2105 Byte |
Status | WA |
Exec Time | 86 ms |
Memory | 14976 KB |
Compile Error
./Main.cpp: In function ‘void MAIN()’: ./Main.cpp:32:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:35:23: 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 | 0 / 1400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 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, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 70.txt, 71.txt, 72.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 61 ms | 12416 KB |
02.txt | WA | 61 ms | 12416 KB |
03.txt | WA | 61 ms | 12416 KB |
04.txt | WA | 63 ms | 12416 KB |
05.txt | WA | 62 ms | 12416 KB |
06.txt | WA | 62 ms | 12416 KB |
07.txt | WA | 63 ms | 12416 KB |
08.txt | WA | 61 ms | 12416 KB |
09.txt | AC | 54 ms | 11264 KB |
10.txt | AC | 54 ms | 11392 KB |
11.txt | AC | 28 ms | 8064 KB |
12.txt | AC | 28 ms | 8064 KB |
13.txt | AC | 86 ms | 14976 KB |
14.txt | AC | 76 ms | 13952 KB |
15.txt | AC | 81 ms | 14080 KB |
16.txt | WA | 74 ms | 13440 KB |
17.txt | AC | 44 ms | 13236 KB |
18.txt | AC | 46 ms | 13160 KB |
19.txt | AC | 50 ms | 12976 KB |
20.txt | AC | 51 ms | 12928 KB |
21.txt | AC | 52 ms | 12928 KB |
22.txt | AC | 53 ms | 12928 KB |
23.txt | AC | 44 ms | 13560 KB |
24.txt | AC | 45 ms | 13560 KB |
25.txt | AC | 53 ms | 13052 KB |
26.txt | AC | 54 ms | 12672 KB |
27.txt | AC | 55 ms | 12672 KB |
28.txt | AC | 57 ms | 12672 KB |
29.txt | AC | 57 ms | 12672 KB |
30.txt | AC | 59 ms | 12672 KB |
31.txt | AC | 59 ms | 12672 KB |
32.txt | AC | 61 ms | 12544 KB |
33.txt | AC | 60 ms | 12544 KB |
34.txt | AC | 62 ms | 12544 KB |
35.txt | AC | 61 ms | 12544 KB |
36.txt | AC | 63 ms | 12416 KB |
37.txt | AC | 62 ms | 12416 KB |
38.txt | AC | 63 ms | 12416 KB |
39.txt | AC | 63 ms | 12416 KB |
40.txt | AC | 63 ms | 12544 KB |
41.txt | AC | 62 ms | 12544 KB |
42.txt | AC | 64 ms | 12416 KB |
43.txt | AC | 65 ms | 12416 KB |
44.txt | AC | 52 ms | 12928 KB |
45.txt | AC | 52 ms | 12928 KB |
46.txt | WA | 55 ms | 12928 KB |
47.txt | WA | 55 ms | 12928 KB |
48.txt | WA | 60 ms | 12800 KB |
49.txt | WA | 59 ms | 12800 KB |
50.txt | WA | 64 ms | 12544 KB |
51.txt | WA | 64 ms | 12672 KB |
52.txt | WA | 67 ms | 12544 KB |
53.txt | WA | 67 ms | 12544 KB |
54.txt | WA | 66 ms | 12544 KB |
55.txt | WA | 68 ms | 12544 KB |
56.txt | AC | 43 ms | 13560 KB |
57.txt | AC | 65 ms | 14204 KB |
58.txt | AC | 65 ms | 14204 KB |
59.txt | AC | 74 ms | 13440 KB |
60.txt | AC | 78 ms | 13440 KB |
61.txt | AC | 51 ms | 13428 KB |
62.txt | AC | 51 ms | 13428 KB |
63.txt | AC | 3 ms | 4992 KB |
64.txt | AC | 4 ms | 4992 KB |
65.txt | AC | 4 ms | 4992 KB |
66.txt | AC | 4 ms | 4992 KB |
67.txt | AC | 4 ms | 4992 KB |
68.txt | AC | 4 ms | 4992 KB |
69.txt | AC | 3 ms | 4992 KB |
70.txt | AC | 4 ms | 4992 KB |
71.txt | AC | 3 ms | 4992 KB |
72.txt | AC | 4 ms | 4992 KB |
s1.txt | AC | 3 ms | 4992 KB |
s2.txt | AC | 4 ms | 4992 KB |