Submission #1070724
Source Code Expand
#ifdef DEBUG #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> using namespace std; mt19937 mrand(random_device{} ()); int rnd(int x) { return mrand() % x; } typedef long double ld; typedef long long ll; #ifdef DEBUG #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr) #else #define eprintf(...) ; #endif #define pb push_back #define mp make_pair #define sz(x) ((int) (x).size()) #define TASK "text" const int inf = (int) 1.01e9; const ld eps = 1e-9; const ld pi = acos((ld) -1.0); const int mod = (int) 1e9 + 7; void add(int &x, int y) { if ((x += y) >= mod) { x -= mod; } } int mult(int x, int y) { return (long long) x * y % mod; } int myPower(int x, int pw) { int res = 1; for (; pw; pw >>= 1) { if (pw & 1) { res = mult(res, x); } x = mult(x, x); } return res; } void precalc() { } const int maxn = (int) 2e5 + 10; string s; int n; vector<vector<int> > es, ds, mxds[2]; int read() { if (scanf("%d", &n) < 1) { return 0; } es = vector<vector<int> >(n); for (int i = 0; i < n - 1; ++i) { int s, t; scanf("%d%d", &s, &t); --s, --t; es[s].pb(t), es[t].pb(s); } cin >> s; return 1; } int cnt[maxn]; void dfs(int v, int p) { if (p != -1) { es[v].erase(find(es[v].begin(), es[v].end(), p)); } ds[v].clear(); cnt[v] = (s[v] == '1'); for (int u : es[v]) { dfs(u, v); ds[v].pb(mxds[0][u].back() + 1); cnt[v] += cnt[u]; } mxds[0][v].clear(); mxds[0][v].pb(0); for (int i = 0; i < sz(es[v]); ++i) { mxds[0][v].pb(max(mxds[0][v].back(), ds[v][i])); } mxds[1][v].clear(); mxds[1][v].pb(0); for (int i = sz(es[v]) - 1; i >= 0; --i) { mxds[1][v].pb(max(mxds[1][v].back(), ds[v][i])); } } int up[maxn]; long long res; bool once; void dfs2(int v) { int mxs[2] = {0, 0}; for (int i = 0; i <= sz(es[v]); ++i) { int cur; if (i == sz(es[v])) { if (!v) { continue; } cur = up[v]; } else { cur = ds[v][i]; } if (mxs[1] < cur) { mxs[1] = cur; if (mxs[0] < mxs[1]) { swap(mxs[0], mxs[1]); } } } /*eprintf("v = %d, mxs = {%d>=%d}\n", v, mxs[0], mxs[1]); eprintf("up[%d] = %d\n", v, up[v]); for (int it = 0; it < sz(es[v]); ++it) { eprintf("%d(u=%d)%c", ds[v][it], es[v][it], " \n"[it == sz(es[v]) - 1]); }*/ { int from = inf; if (s[v] == '1') { from = 0; } else { for (int it = 0; it < sz(es[v]); ++it) { int u = es[v][it]; if (cnt[u]) { from = min(from, ds[v][it]); } } if (cnt[0] > cnt[v]) { from = min(from, up[v]); } } res += max(0, mxs[1] + 1 - from); } if (mxs[0] > mxs[1]) { bool can = s[v] == '1'; for (int it = 0; it < sz(es[v]); ++it) { if (ds[v][it] < mxs[0] && cnt[es[v][it]]) { can = 1; break; } } if (cnt[0] > cnt[v] && up[v] < mxs[0]) { can = 1; } if (can) { if (mxs[0] == mxs[1] + 1) { once = 1; } else { ++res; } } } for (int it = 0; it < sz(es[v]); ++it) { int u = es[v][it]; up[u] = 1 + max(up[v], max(mxds[0][v][it], mxds[1][v][sz(es[v]) - 1 - it])); dfs2(u); } } void solve() { ds.resize(n); mxds[0].resize(n); mxds[1].resize(n); dfs(0, -1); up[0] = 0; res = 0; once = 0; dfs2(0); res += once; printf("%lld\n", res); //exit(0); } int main() { precalc(); #ifdef LOCAL freopen(TASK ".out", "w", stdout); assert(freopen(TASK ".in", "r", stdin)); #endif while (1) { if (!read()) { break; } solve(); #ifdef DEBUG eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC); #endif } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | XraY |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 3943 Byte |
Status | AC |
Exec Time | 396 ms |
Memory | 57604 KB |
Compile Error
./Main.cpp: In function ‘int read()’: ./Main.cpp:73:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &s, &t); ^
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 | 256 KB |
0_01.txt | AC | 3 ms | 256 KB |
0_02.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 396 ms | 57604 KB |
1_02.txt | AC | 365 ms | 53380 KB |
1_03.txt | AC | 313 ms | 45828 KB |
1_04.txt | AC | 307 ms | 44280 KB |
1_05.txt | AC | 238 ms | 42740 KB |
1_06.txt | AC | 278 ms | 43396 KB |
1_07.txt | AC | 287 ms | 43392 KB |
1_08.txt | AC | 313 ms | 44292 KB |
1_09.txt | AC | 335 ms | 49540 KB |
1_10.txt | AC | 344 ms | 49028 KB |
1_11.txt | AC | 349 ms | 56580 KB |
1_12.txt | AC | 305 ms | 45188 KB |
1_13.txt | AC | 308 ms | 49412 KB |
1_14.txt | AC | 296 ms | 45828 KB |
1_15.txt | AC | 316 ms | 45060 KB |
1_16.txt | AC | 342 ms | 47488 KB |
1_17.txt | AC | 360 ms | 49924 KB |
1_18.txt | AC | 313 ms | 44548 KB |
1_19.txt | AC | 311 ms | 43652 KB |
1_20.txt | AC | 348 ms | 44676 KB |
1_21.txt | AC | 352 ms | 46340 KB |
1_22.txt | AC | 297 ms | 43900 KB |
1_23.txt | AC | 297 ms | 43520 KB |
1_24.txt | AC | 292 ms | 43908 KB |
1_25.txt | AC | 338 ms | 45944 KB |
1_26.txt | AC | 268 ms | 41980 KB |
1_27.txt | AC | 280 ms | 42864 KB |
1_28.txt | AC | 255 ms | 43128 KB |
1_29.txt | AC | 275 ms | 45820 KB |
2_00.txt | AC | 3 ms | 256 KB |
2_01.txt | AC | 343 ms | 57220 KB |
2_02.txt | AC | 345 ms | 55300 KB |
2_03.txt | AC | 359 ms | 54788 KB |
2_04.txt | AC | 345 ms | 51460 KB |
2_05.txt | AC | 349 ms | 51716 KB |
2_06.txt | AC | 354 ms | 52612 KB |
2_07.txt | AC | 311 ms | 45828 KB |
2_08.txt | AC | 310 ms | 45828 KB |
2_09.txt | AC | 309 ms | 45828 KB |
2_10.txt | AC | 320 ms | 44280 KB |
2_11.txt | AC | 313 ms | 44280 KB |
2_12.txt | AC | 309 ms | 44280 KB |
2_13.txt | AC | 251 ms | 42740 KB |
2_14.txt | AC | 224 ms | 42740 KB |
2_15.txt | AC | 226 ms | 42740 KB |
2_16.txt | AC | 288 ms | 43396 KB |
2_17.txt | AC | 279 ms | 43396 KB |
2_18.txt | AC | 271 ms | 43396 KB |
2_19.txt | AC | 283 ms | 43396 KB |
2_20.txt | AC | 287 ms | 43396 KB |
2_21.txt | AC | 276 ms | 43396 KB |
2_22.txt | AC | 294 ms | 44164 KB |
2_23.txt | AC | 298 ms | 44800 KB |
2_24.txt | AC | 292 ms | 44676 KB |
2_25.txt | AC | 302 ms | 49924 KB |
2_26.txt | AC | 327 ms | 48772 KB |
2_27.txt | AC | 299 ms | 49920 KB |
2_28.txt | AC | 311 ms | 48640 KB |
2_29.txt | AC | 339 ms | 55428 KB |
2_30.txt | AC | 305 ms | 52868 KB |
2_31.txt | AC | 313 ms | 49412 KB |
2_32.txt | AC | 284 ms | 43908 KB |
2_33.txt | AC | 282 ms | 46336 KB |
2_34.txt | AC | 300 ms | 48004 KB |
2_35.txt | AC | 342 ms | 51716 KB |
2_36.txt | AC | 294 ms | 44932 KB |
2_37.txt | AC | 288 ms | 44548 KB |
2_38.txt | AC | 292 ms | 44548 KB |
2_39.txt | AC | 304 ms | 45696 KB |
2_40.txt | AC | 314 ms | 43896 KB |
2_41.txt | AC | 270 ms | 43268 KB |
2_42.txt | AC | 302 ms | 43504 KB |
2_43.txt | AC | 331 ms | 49412 KB |
2_44.txt | AC | 279 ms | 42480 KB |
2_45.txt | AC | 242 ms | 42616 KB |
2_46.txt | AC | 263 ms | 42868 KB |
2_47.txt | AC | 308 ms | 46064 KB |