Submission #1044235
Source Code Expand
#include <iostream> #include <vector> #include <cmath> #include <ctime> #include <cassert> #include <cstdio> #include <queue> #include <set> #include <map> #include <fstream> #include <cstdlib> #include <string> #include <cstring> #include <algorithm> #include <numeric> #define mp make_pair #define fi first #define se second #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define forn(i, n) for (int i = 0; i < (int)(n); ++i) #define for1(i, n) for (int i = 1; i <= (int)(n); ++i) #define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i) #define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i) using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef long long i64; typedef vector<i64> vi64; typedef vector<vi64> vvi64; template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; } template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; } const int maxn = 310000; vi e[maxn]; int d[maxn][2], dup[maxn]; int rad[maxn]; int dth[maxn]; string s; void add(int *m, int x) { forn(i, 2) if (x > m[i]) swap(x, m[i]); } int max_exc(int *m, int x) { forn(i, 2) { if (m[i] == x) x = -1; else return m[i]; } return -1; } void dfs_d(int v, int p) { for (int u: e[v]) { if (u == p) continue; dfs_d(u, v); add(d[v], max_exc(d[u], -1) + 1); } } void dfs_up(int v, int p, int D) { dup[v] = D; for (int u: e[v]) { if (u == p) continue; dfs_up(u, v, max(D, max_exc(d[v], d[u][0] + 1) + 1) + 1); } } i64 ans; int dfs_C(int v, int p) { dth[v] = 0; int minq = s[v] == '1' ? 0 : 1e9; for (int u: e[v]) { if (u == p) continue; uin(minq, dfs_C(u, v) - 1); uax(dth[v], dth[u] + 1); } int sk = max(0, min(rad[v] - 1, dth[v] + 1) - minq + 1); //uin(sk, rad[v] - 1); ans += sk; minq += sk; if (minq == rad[v]) minq = 1e9; return minq; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.precision(10); cout << fixed; #ifdef LOCAL_DEFINE freopen("input.txt", "rt", stdin); #endif int n; cin >> n; forn(i, n - 1) { int x, y; cin >> x >> y; --x; --y; e[x].pb(y); e[y].pb(x); } cin >> s; forn(i, n) forn(j, 2) d[i][j] = -1; dfs_d(0, -1); dfs_up(0, -1, -1e9); forn(i, n) rad[i] = max(dup[i], max_exc(d[i], -1) + 1); int C = 0; forn(i, n) if (rad[i] < rad[C]) C = i; ans = 1; dfs_C(C, -1); cout << ans << '\n'; #ifdef LOCAL_DEFINE cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Black Radius |
User | endagorion |
Language | C++14 (GCC 5.4.1) |
Score | 1900 |
Code Size | 2876 Byte |
Status | AC |
Exec Time | 168 ms |
Memory | 27536 KB |
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 | 10 ms | 7552 KB |
0_01.txt | AC | 10 ms | 7552 KB |
0_02.txt | AC | 10 ms | 7552 KB |
1_00.txt | AC | 10 ms | 7552 KB |
1_01.txt | AC | 150 ms | 27536 KB |
1_02.txt | AC | 140 ms | 24208 KB |
1_03.txt | AC | 124 ms | 18064 KB |
1_04.txt | AC | 117 ms | 18552 KB |
1_05.txt | AC | 81 ms | 19060 KB |
1_06.txt | AC | 113 ms | 18192 KB |
1_07.txt | AC | 115 ms | 18316 KB |
1_08.txt | AC | 116 ms | 18960 KB |
1_09.txt | AC | 129 ms | 22800 KB |
1_10.txt | AC | 125 ms | 22408 KB |
1_11.txt | AC | 149 ms | 27412 KB |
1_12.txt | AC | 124 ms | 20104 KB |
1_13.txt | AC | 134 ms | 22420 KB |
1_14.txt | AC | 121 ms | 19976 KB |
1_15.txt | AC | 121 ms | 19336 KB |
1_16.txt | AC | 124 ms | 20748 KB |
1_17.txt | AC | 136 ms | 22280 KB |
1_18.txt | AC | 122 ms | 18064 KB |
1_19.txt | AC | 116 ms | 18064 KB |
1_20.txt | AC | 123 ms | 18064 KB |
1_21.txt | AC | 129 ms | 18696 KB |
1_22.txt | AC | 111 ms | 18316 KB |
1_23.txt | AC | 119 ms | 18192 KB |
1_24.txt | AC | 129 ms | 18824 KB |
1_25.txt | AC | 126 ms | 19960 KB |
1_26.txt | AC | 108 ms | 18172 KB |
1_27.txt | AC | 106 ms | 18552 KB |
1_28.txt | AC | 99 ms | 18936 KB |
1_29.txt | AC | 111 ms | 20872 KB |
2_00.txt | AC | 10 ms | 7552 KB |
2_01.txt | AC | 144 ms | 27152 KB |
2_02.txt | AC | 148 ms | 25872 KB |
2_03.txt | AC | 148 ms | 25872 KB |
2_04.txt | AC | 128 ms | 23184 KB |
2_05.txt | AC | 131 ms | 23184 KB |
2_06.txt | AC | 145 ms | 23440 KB |
2_07.txt | AC | 122 ms | 18060 KB |
2_08.txt | AC | 154 ms | 18064 KB |
2_09.txt | AC | 140 ms | 18064 KB |
2_10.txt | AC | 101 ms | 18552 KB |
2_11.txt | AC | 103 ms | 18552 KB |
2_12.txt | AC | 104 ms | 18552 KB |
2_13.txt | AC | 83 ms | 18932 KB |
2_14.txt | AC | 81 ms | 18932 KB |
2_15.txt | AC | 81 ms | 18932 KB |
2_16.txt | AC | 128 ms | 18192 KB |
2_17.txt | AC | 121 ms | 18192 KB |
2_18.txt | AC | 116 ms | 18192 KB |
2_19.txt | AC | 117 ms | 18320 KB |
2_20.txt | AC | 121 ms | 18320 KB |
2_21.txt | AC | 119 ms | 18192 KB |
2_22.txt | AC | 123 ms | 18956 KB |
2_23.txt | AC | 125 ms | 19344 KB |
2_24.txt | AC | 124 ms | 19216 KB |
2_25.txt | AC | 153 ms | 23184 KB |
2_26.txt | AC | 133 ms | 22160 KB |
2_27.txt | AC | 146 ms | 23180 KB |
2_28.txt | AC | 134 ms | 21768 KB |
2_29.txt | AC | 168 ms | 25992 KB |
2_30.txt | AC | 153 ms | 24712 KB |
2_31.txt | AC | 145 ms | 22408 KB |
2_32.txt | AC | 118 ms | 18568 KB |
2_33.txt | AC | 121 ms | 20112 KB |
2_34.txt | AC | 129 ms | 21384 KB |
2_35.txt | AC | 142 ms | 23560 KB |
2_36.txt | AC | 124 ms | 17932 KB |
2_37.txt | AC | 125 ms | 18060 KB |
2_38.txt | AC | 128 ms | 18952 KB |
2_39.txt | AC | 127 ms | 18196 KB |
2_40.txt | AC | 116 ms | 18424 KB |
2_41.txt | AC | 120 ms | 18184 KB |
2_42.txt | AC | 103 ms | 18296 KB |
2_43.txt | AC | 127 ms | 22676 KB |
2_44.txt | AC | 100 ms | 18552 KB |
2_45.txt | AC | 89 ms | 18932 KB |
2_46.txt | AC | 88 ms | 18936 KB |
2_47.txt | AC | 110 ms | 21240 KB |