Submission #1046583
Source Code Expand
#include<stdio.h> #include<vector> #include<algorithm> #include<string> #include<iostream> using namespace std; typedef long long ll; int dp1[200000], dp2[200000]; int len1[200000], len2[200000]; int cnt[200000]; string str; vector<int>pat[200000]; vector<int>ko[200000]; bool flag[200000]; #define ROOT 0 typedef pair<int, int>pii; void dfs(int node) { if (flag[node])return; flag[node] = true; if (str[node] == '1')cnt[node]++; for (int i = 0; i < pat[node].size(); i++) { if (!flag[pat[node][i]]) { ko[node].push_back(pat[node][i]); dfs(pat[node][i]); cnt[node] += cnt[pat[node][i]]; } } } void calc1(int node) { for (int i = 0; i < ko[node].size(); i++)calc1(ko[node][i]); int m1 = 0, m2 = 0, r1 = -1, r2 = -2; for (int i = 0; i < ko[node].size(); i++) { int v = ko[node][i]; if (m1 < len1[v]) { m2 = m1, r2 = r1; m1 = len1[v], r1 = i; } else if (m2 < len1[v])m2 = len1[v], r2 = i; } len1[node] = m1 + 1; int mini = 1000000000; if (r1 >= 0)mini = min(mini, max(dp1[ko[node][r1]] - 1, m2)); if (cnt[node] > 0)mini = min(mini, m1); dp1[node] = mini; } void calc2(int node) { vector<pii>m; vector<int>zm, zd; for (int i = 0; i < ko[node].size(); i++) { m.push_back(make_pair(len1[ko[node][i]], i)); zd.push_back(dp1[ko[node][i]]); zm.push_back(len1[ko[node][i]]); } if (node != ROOT) { m.push_back(make_pair(len2[node], m.size())); zd.push_back(dp2[node]); zm.push_back(len2[node]); } sort(m.begin(), m.end()); reverse(m.begin(), m.end()); int x = m.size(); for (int i = 0; i < ko[node].size(); i++) { int mini = 1000000000; vector<int>z; for (int j = 0; j < min(3, x); j++) { if (i == m[j].second)continue; z.push_back(m[j].second); } if (z.size() >= 2)mini = min(mini, max(zd[z[0]] - 1, zm[z[1]])); if (z.size() == 1)mini = min(mini, max(zd[z[0]] - 1, 0)); if (cnt[ROOT] - cnt[ko[node][i]] > 0 && z.size() > 0)mini = min(mini, zm[z[0]]); if (cnt[ROOT] - cnt[ko[node][i]] > 0 && z.size() == 0)mini = min(mini, 0); dp2[ko[node][i]] = mini; int maxi = 0; for (int j = 0; j < min(3, x); j++) { if (i == m[j].second)continue; maxi = max(maxi, m[j].first); } len2[ko[node][i]] = maxi + 1; } for (int i = 0; i < ko[node].size(); i++)calc2(ko[node][i]); } int main() { int num; scanf("%d", &num); for (int i = 0; i < num - 1; i++) { int za, zb; scanf("%d%d", &za, &zb); za--, zb--; pat[za].push_back(zb); pat[zb].push_back(za); } cin >> str; dfs(ROOT); calc1(ROOT); calc2(ROOT); ll ans = 1; //for (int i = 0; i < num; i++)printf("%d %d %d %d\n", len1[i], len2[i], dp1[i], dp2[i]); for (int i = 0; i < num; i++) { vector<pii>m; vector<int>zm, zd; for (int j = 0; j < ko[i].size(); j++) { m.push_back(make_pair(len1[ko[i][j]],j)); zm.push_back(len1[ko[i][j]]); zd.push_back(dp1[ko[i][j]]); } if (i != ROOT) { m.push_back(make_pair(len2[i], m.size())); zm.push_back(len2[i]); zd.push_back(dp2[i]); } sort(m.begin(), m.end()); reverse(m.begin(), m.end()); ll ret = 0; if (m.size() >= 2)if (str[i] == '1')ret += m[1].first; int mini = 1000000000; if (m.size() >= 3) { for (int j = 0; j < m.size(); j++) { vector<int>z; for (int k = 0; k < 3; k++) { if (m[k].second != j)z.push_back(m[k].first); } int lb = max(zd[j] - 1, 0), ub = min(z[1] - 1, zm[j] - 1); ret += max(0, ub - lb + 1); mini = min(mini, max(lb, zm[j])); } if (str[i] == '0')ret += max(0, m[1].first - mini); } ll sum = 0; for (int j = 0; j < m.size(); j++)if (zd[j] == 0)sum++; ans += ret + sum; //printf("%d %lld %lld\n", i + 1, ret, sum); } printf("%lld\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | DEGwer |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 3821 Byte |
Status | AC |
Exec Time | 368 ms |
Memory | 74116 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:98:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &num); ^ ./Main.cpp:102:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &za, &zb); ^
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 | 12 ms | 9600 KB |
0_01.txt | AC | 13 ms | 9600 KB |
0_02.txt | AC | 13 ms | 9600 KB |
1_00.txt | AC | 12 ms | 9600 KB |
1_01.txt | AC | 356 ms | 74116 KB |
1_02.txt | AC | 348 ms | 57092 KB |
1_03.txt | AC | 265 ms | 26628 KB |
1_04.txt | AC | 265 ms | 26200 KB |
1_05.txt | AC | 237 ms | 27076 KB |
1_06.txt | AC | 294 ms | 23684 KB |
1_07.txt | AC | 321 ms | 23808 KB |
1_08.txt | AC | 325 ms | 28036 KB |
1_09.txt | AC | 338 ms | 48772 KB |
1_10.txt | AC | 311 ms | 45572 KB |
1_11.txt | AC | 349 ms | 73348 KB |
1_12.txt | AC | 302 ms | 35460 KB |
1_13.txt | AC | 368 ms | 47108 KB |
1_14.txt | AC | 291 ms | 33668 KB |
1_15.txt | AC | 306 ms | 29316 KB |
1_16.txt | AC | 301 ms | 38144 KB |
1_17.txt | AC | 324 ms | 44804 KB |
1_18.txt | AC | 266 ms | 25476 KB |
1_19.txt | AC | 282 ms | 24580 KB |
1_20.txt | AC | 281 ms | 26372 KB |
1_21.txt | AC | 285 ms | 29572 KB |
1_22.txt | AC | 256 ms | 25132 KB |
1_23.txt | AC | 277 ms | 24788 KB |
1_24.txt | AC | 288 ms | 27524 KB |
1_25.txt | AC | 283 ms | 33140 KB |
1_26.txt | AC | 279 ms | 23932 KB |
1_27.txt | AC | 267 ms | 24788 KB |
1_28.txt | AC | 252 ms | 25972 KB |
1_29.txt | AC | 295 ms | 34300 KB |
2_00.txt | AC | 13 ms | 9600 KB |
2_01.txt | AC | 359 ms | 72068 KB |
2_02.txt | AC | 349 ms | 64772 KB |
2_03.txt | AC | 350 ms | 62340 KB |
2_04.txt | AC | 348 ms | 49540 KB |
2_05.txt | AC | 327 ms | 50180 KB |
2_06.txt | AC | 342 ms | 53636 KB |
2_07.txt | AC | 264 ms | 26628 KB |
2_08.txt | AC | 265 ms | 26628 KB |
2_09.txt | AC | 275 ms | 26628 KB |
2_10.txt | AC | 259 ms | 26200 KB |
2_11.txt | AC | 261 ms | 26200 KB |
2_12.txt | AC | 269 ms | 26200 KB |
2_13.txt | AC | 233 ms | 26308 KB |
2_14.txt | AC | 233 ms | 26820 KB |
2_15.txt | AC | 236 ms | 27076 KB |
2_16.txt | AC | 282 ms | 23684 KB |
2_17.txt | AC | 284 ms | 23684 KB |
2_18.txt | AC | 289 ms | 23684 KB |
2_19.txt | AC | 284 ms | 23812 KB |
2_20.txt | AC | 292 ms | 23812 KB |
2_21.txt | AC | 305 ms | 23812 KB |
2_22.txt | AC | 297 ms | 27524 KB |
2_23.txt | AC | 313 ms | 30208 KB |
2_24.txt | AC | 307 ms | 29316 KB |
2_25.txt | AC | 344 ms | 50436 KB |
2_26.txt | AC | 329 ms | 45444 KB |
2_27.txt | AC | 344 ms | 50304 KB |
2_28.txt | AC | 312 ms | 43136 KB |
2_29.txt | AC | 346 ms | 66308 KB |
2_30.txt | AC | 359 ms | 58500 KB |
2_31.txt | AC | 321 ms | 44676 KB |
2_32.txt | AC | 302 ms | 25220 KB |
2_33.txt | AC | 307 ms | 34432 KB |
2_34.txt | AC | 305 ms | 42244 KB |
2_35.txt | AC | 343 ms | 54916 KB |
2_36.txt | AC | 288 ms | 26116 KB |
2_37.txt | AC | 294 ms | 25476 KB |
2_38.txt | AC | 296 ms | 29316 KB |
2_39.txt | AC | 273 ms | 27264 KB |
2_40.txt | AC | 288 ms | 26228 KB |
2_41.txt | AC | 284 ms | 24204 KB |
2_42.txt | AC | 257 ms | 25996 KB |
2_43.txt | AC | 351 ms | 47876 KB |
2_44.txt | AC | 265 ms | 25140 KB |
2_45.txt | AC | 244 ms | 26984 KB |
2_46.txt | AC | 254 ms | 26920 KB |
2_47.txt | AC | 302 ms | 36968 KB |