Submission #1833603
Source Code Expand
// LNU_Algotesters #include <iostream> #include <sstream> #include <iomanip> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <iterator> #include <bitset> #include <ctime> #include <fstream> #include <complex> using namespace std; #define FOR(i,a,b) for (int i = (a); i < (b); i++) #define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--) #define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++) #define FILL(a,value) memset(a, value, sizeof(a)) #define SZ(a) (int)a.size() #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair typedef long long LL; typedef vector<int> VI; typedef pair<int, int> PII; const double PI = acos(-1.0); const int INF = 1000 * 1000 * 1000 + 7; const LL LINF = 2*INF * (LL) INF; const int MAX = 200 * 1000 + 47; const int MOD = INF; VI G[MAX]; char A[MAX]; int S[MAX]; int D[MAX]; LL ans = 0; void dfs(int v, int p = -1) { S[v] = (A[v] == '1'); D[v] = 0; FOR(i, 0, SZ(G[v])) { int to = G[v][i]; if (to == p)continue; dfs(to, v); S[v] += S[to]; D[v] = max(D[v], D[to] + 1); } } void DFS(int v, int p = -1, int x = 0) { int mn = INF; int mx = max(x, 0), mx2 = 0; if (A[v] == '1')mn = 0; if (S[0] != S[v])mn = min(x, mn); FOR(i, 0, SZ(G[v])) { int to = G[v][i]; if (to == p)continue; if (D[to] + 1 > mx) mx2 = mx, mx = D[to] + 1; else mx2 = max(mx2, D[to] + 1); if (S[to] != 0)mn = min(mn, D[to] + 1); } ans += max(0, min(mx-1, mx2+1) - mn + 1); FOR(i, 0, SZ(G[v])) { int to = G[v][i]; if(to == p)continue; if (D[to] + 1 == mx) DFS(to, v, mx2 + 1); else DFS(to, v, mx + 1); } } int main() { int n; scanf("%d", &n); FOR(i, 0, n-1) { int x, y; scanf("%d%d", &x, &y); --x, --y; G[x].PB(y); G[y].PB(x); } scanf("%s", A); dfs(0); DFS(0); ++ans; printf("%lld\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | TarasChaika |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 2383 Byte |
Status | AC |
Exec Time | 126 ms |
Memory | 24832 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:105:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:109:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &x, &y); ^ ./Main.cpp:114:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", A); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | 600 / 600 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
Subtask | 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt, 2_23.txt, 2_24.txt, 2_25.txt, 2_26.txt, 2_27.txt, 2_28.txt, 2_29.txt, 2_30.txt, 2_31.txt, 2_32.txt, 2_33.txt, 2_34.txt, 2_35.txt, 2_36.txt, 2_37.txt, 2_38.txt, 2_39.txt, 2_40.txt, 2_41.txt, 2_42.txt, 2_43.txt, 2_44.txt, 2_45.txt, 2_46.txt, 2_47.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 3 ms | 4992 KB |
0_01.txt | AC | 3 ms | 4992 KB |
0_02.txt | AC | 3 ms | 4992 KB |
1_00.txt | AC | 3 ms | 4992 KB |
1_01.txt | AC | 124 ms | 24832 KB |
1_02.txt | AC | 102 ms | 20608 KB |
1_03.txt | AC | 95 ms | 13056 KB |
1_04.txt | AC | 87 ms | 13304 KB |
1_05.txt | AC | 66 ms | 13684 KB |
1_06.txt | AC | 90 ms | 13184 KB |
1_07.txt | AC | 91 ms | 13184 KB |
1_08.txt | AC | 93 ms | 14080 KB |
1_09.txt | AC | 103 ms | 18944 KB |
1_10.txt | AC | 96 ms | 18048 KB |
1_11.txt | AC | 108 ms | 24704 KB |
1_12.txt | AC | 91 ms | 15616 KB |
1_13.txt | AC | 99 ms | 18432 KB |
1_14.txt | AC | 93 ms | 15360 KB |
1_15.txt | AC | 92 ms | 14336 KB |
1_16.txt | AC | 102 ms | 16256 KB |
1_17.txt | AC | 99 ms | 17664 KB |
1_18.txt | AC | 92 ms | 12928 KB |
1_19.txt | AC | 91 ms | 13056 KB |
1_20.txt | AC | 92 ms | 13056 KB |
1_21.txt | AC | 95 ms | 13824 KB |
1_22.txt | AC | 83 ms | 13180 KB |
1_23.txt | AC | 85 ms | 13180 KB |
1_24.txt | AC | 94 ms | 13952 KB |
1_25.txt | AC | 85 ms | 15096 KB |
1_26.txt | AC | 83 ms | 13052 KB |
1_27.txt | AC | 80 ms | 13432 KB |
1_28.txt | AC | 74 ms | 13816 KB |
1_29.txt | AC | 89 ms | 15868 KB |
2_00.txt | AC | 3 ms | 4992 KB |
2_01.txt | AC | 123 ms | 24320 KB |
2_02.txt | AC | 126 ms | 22528 KB |
2_03.txt | AC | 107 ms | 21888 KB |
2_04.txt | AC | 102 ms | 18688 KB |
2_05.txt | AC | 101 ms | 18944 KB |
2_06.txt | AC | 118 ms | 19712 KB |
2_07.txt | AC | 94 ms | 13056 KB |
2_08.txt | AC | 94 ms | 13056 KB |
2_09.txt | AC | 94 ms | 12928 KB |
2_10.txt | AC | 81 ms | 13304 KB |
2_11.txt | AC | 81 ms | 13304 KB |
2_12.txt | AC | 80 ms | 13304 KB |
2_13.txt | AC | 64 ms | 13684 KB |
2_14.txt | AC | 62 ms | 13684 KB |
2_15.txt | AC | 62 ms | 13684 KB |
2_16.txt | AC | 96 ms | 13184 KB |
2_17.txt | AC | 94 ms | 13184 KB |
2_18.txt | AC | 92 ms | 13184 KB |
2_19.txt | AC | 93 ms | 13184 KB |
2_20.txt | AC | 90 ms | 13184 KB |
2_21.txt | AC | 116 ms | 13184 KB |
2_22.txt | AC | 92 ms | 13952 KB |
2_23.txt | AC | 93 ms | 14592 KB |
2_24.txt | AC | 94 ms | 14464 KB |
2_25.txt | AC | 101 ms | 19328 KB |
2_26.txt | AC | 103 ms | 18176 KB |
2_27.txt | AC | 101 ms | 19328 KB |
2_28.txt | AC | 98 ms | 17664 KB |
2_29.txt | AC | 109 ms | 22912 KB |
2_30.txt | AC | 104 ms | 21248 KB |
2_31.txt | AC | 99 ms | 17664 KB |
2_32.txt | AC | 91 ms | 13440 KB |
2_33.txt | AC | 93 ms | 15616 KB |
2_34.txt | AC | 95 ms | 17280 KB |
2_35.txt | AC | 101 ms | 19968 KB |
2_36.txt | AC | 92 ms | 12928 KB |
2_37.txt | AC | 93 ms | 13056 KB |
2_38.txt | AC | 94 ms | 14208 KB |
2_39.txt | AC | 94 ms | 13184 KB |
2_40.txt | AC | 82 ms | 13304 KB |
2_41.txt | AC | 87 ms | 13184 KB |
2_42.txt | AC | 78 ms | 13176 KB |
2_43.txt | AC | 103 ms | 18688 KB |
2_44.txt | AC | 77 ms | 13304 KB |
2_45.txt | AC | 69 ms | 13560 KB |
2_46.txt | AC | 70 ms | 13812 KB |
2_47.txt | AC | 88 ms | 16504 KB |