Submission #1071533
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <vector> #include <algorithm> #include <cmath> using namespace std; #define mp make_pair #define pb push_back #define ll long long #define maxN 200011 int n, i, x, y, C; vector<int> list[maxN]; char tp[maxN]; int down[maxN], up[maxN], dist[maxN], high[maxN], low[maxN], cnt[maxN]; vector< pair<int, int> > aux; vector<int> loc; ll ans; void dfs(int node, int root) { down[node] = 0; for (auto to : list[node]) { if (to == root) continue; dfs(to, node); down[node] = max(down[node], down[to] + 1); } } void dfs2(int node, int root) { aux.clear(); loc.clear(); for (auto e : list[node]) if (e != root) loc.pb(down[e] + 1); loc.pb(up[node]); if(loc.size() == 1) loc.pb(0); sort(loc.begin(), loc.end()); high[node] = min(loc.back() - 1, loc[loc.size() - 2] + 1); dist[node] = max(down[node], up[node]); for (auto to : list[node]) { if (to == root) continue; aux.pb(mp(down[to], to)); } if (aux.empty()) return; if (aux.size() == 1) { up[aux[0].second] = up[node] + 1; dfs2(aux[0].second, node); return; } sort(aux.begin(), aux.end()); reverse(aux.begin(), aux.end()); up[aux[0].second] = max(up[node] + 1, aux[1].first + 2); for (int i = 1; i < aux.size(); i++) up[aux[i].second] = max(up[node] + 1, aux[0].first + 2); for (auto e : list[node]) if (e != root) dfs2(e, node); } void solve(int node, int root) { down[node] = 0; cnt[node] = tp[node] - '0'; low[node] = 1 << 30; if (tp[node] == '1') low[node] = 0; for (auto to : list[node]) { if (to == root) continue; solve(to, node); down[node] = max(down[node], down[to] + 1); cnt[node] += cnt[to]; if (cnt[to]) low[node] = min(low[node], down[to] + 1); } if (low[node] <= high[node]) ans += 1LL * (high[node] - low[node] + 1); } int main() { // freopen("test.in","r",stdin); scanf("%d", &n); for (i = 1; i < n; i++) { scanf("%d%d", &x, &y); list[x].pb(y); list[y].pb(x); } scanf("\n%s", tp + 1); dfs(1, 0); dfs2(1, 0); C = min_element(dist + 1, dist + n + 1) - dist; solve(C, 0); if (cnt[C] == 0) { printf("0"); return 0; } printf("%lld", ans + 1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | atatomir |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 2607 Byte |
Status | AC |
Exec Time | 184 ms |
Memory | 30336 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:102:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:104: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:109:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("\n%s", tp + 1); ^
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 | 8 ms | 4992 KB |
0_01.txt | AC | 8 ms | 4992 KB |
0_02.txt | AC | 8 ms | 4992 KB |
1_00.txt | AC | 8 ms | 4992 KB |
1_01.txt | AC | 176 ms | 30336 KB |
1_02.txt | AC | 157 ms | 25216 KB |
1_03.txt | AC | 135 ms | 16128 KB |
1_04.txt | AC | 134 ms | 17780 KB |
1_05.txt | AC | 130 ms | 19312 KB |
1_06.txt | AC | 130 ms | 16256 KB |
1_07.txt | AC | 128 ms | 16256 KB |
1_08.txt | AC | 149 ms | 17408 KB |
1_09.txt | AC | 154 ms | 23296 KB |
1_10.txt | AC | 144 ms | 22144 KB |
1_11.txt | AC | 166 ms | 30208 KB |
1_12.txt | AC | 131 ms | 19200 KB |
1_13.txt | AC | 144 ms | 22656 KB |
1_14.txt | AC | 134 ms | 18944 KB |
1_15.txt | AC | 144 ms | 17664 KB |
1_16.txt | AC | 138 ms | 20096 KB |
1_17.txt | AC | 153 ms | 21760 KB |
1_18.txt | AC | 138 ms | 16128 KB |
1_19.txt | AC | 134 ms | 16256 KB |
1_20.txt | AC | 136 ms | 16128 KB |
1_21.txt | AC | 136 ms | 17024 KB |
1_22.txt | AC | 129 ms | 17272 KB |
1_23.txt | AC | 140 ms | 16888 KB |
1_24.txt | AC | 130 ms | 17536 KB |
1_25.txt | AC | 140 ms | 19572 KB |
1_26.txt | AC | 133 ms | 16888 KB |
1_27.txt | AC | 123 ms | 17652 KB |
1_28.txt | AC | 126 ms | 18676 KB |
1_29.txt | AC | 135 ms | 20600 KB |
2_00.txt | AC | 8 ms | 4992 KB |
2_01.txt | AC | 168 ms | 29696 KB |
2_02.txt | AC | 173 ms | 27520 KB |
2_03.txt | AC | 168 ms | 26880 KB |
2_04.txt | AC | 175 ms | 23040 KB |
2_05.txt | AC | 151 ms | 23168 KB |
2_06.txt | AC | 159 ms | 24192 KB |
2_07.txt | AC | 153 ms | 16128 KB |
2_08.txt | AC | 135 ms | 16128 KB |
2_09.txt | AC | 136 ms | 16128 KB |
2_10.txt | AC | 127 ms | 17780 KB |
2_11.txt | AC | 128 ms | 17780 KB |
2_12.txt | AC | 135 ms | 17780 KB |
2_13.txt | AC | 119 ms | 19312 KB |
2_14.txt | AC | 120 ms | 19312 KB |
2_15.txt | AC | 125 ms | 19312 KB |
2_16.txt | AC | 140 ms | 16256 KB |
2_17.txt | AC | 133 ms | 16256 KB |
2_18.txt | AC | 128 ms | 16256 KB |
2_19.txt | AC | 184 ms | 16256 KB |
2_20.txt | AC | 139 ms | 16256 KB |
2_21.txt | AC | 142 ms | 16256 KB |
2_22.txt | AC | 139 ms | 17280 KB |
2_23.txt | AC | 137 ms | 18048 KB |
2_24.txt | AC | 144 ms | 17792 KB |
2_25.txt | AC | 151 ms | 23808 KB |
2_26.txt | AC | 147 ms | 22272 KB |
2_27.txt | AC | 156 ms | 23680 KB |
2_28.txt | AC | 164 ms | 21632 KB |
2_29.txt | AC | 166 ms | 28032 KB |
2_30.txt | AC | 159 ms | 25984 KB |
2_31.txt | AC | 155 ms | 21760 KB |
2_32.txt | AC | 133 ms | 16640 KB |
2_33.txt | AC | 149 ms | 19200 KB |
2_34.txt | AC | 175 ms | 21248 KB |
2_35.txt | AC | 170 ms | 24576 KB |
2_36.txt | AC | 134 ms | 16000 KB |
2_37.txt | AC | 131 ms | 16128 KB |
2_38.txt | AC | 138 ms | 17536 KB |
2_39.txt | AC | 134 ms | 16384 KB |
2_40.txt | AC | 130 ms | 17268 KB |
2_41.txt | AC | 140 ms | 16636 KB |
2_42.txt | AC | 125 ms | 17524 KB |
2_43.txt | AC | 150 ms | 23420 KB |
2_44.txt | AC | 125 ms | 17652 KB |
2_45.txt | AC | 120 ms | 18676 KB |
2_46.txt | AC | 125 ms | 18928 KB |
2_47.txt | AC | 134 ms | 21364 KB |