Submission #1692629


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long i64;

#define iter(i, n) for (int i = 1; i <= n; ++i)
#define NR 201000

const int inf = 1e9;

vector<int> g[NR];
char s[NR];
int m1[NR], m2[NR], n, son[NR];
i64 ans;

void dfs(int x, int fa) {
	m2[x] = -inf; m1[x] = -1;
	for (int v : g[x]) if (v != fa) {
		dfs(v, x);
		if (m1[x] == m1[v]) son[x] = 0;

		if (m1[v] > m1[x]) m2[x] = m1[x], m1[x] = m1[v], son[x] = v;
		else if (m1[v] > m2[x]) m2[x] = m1[v];
	}
	++m1[x], ++m2[x];
//	printf("!!%d %d\n", m1[x], m2[x]);
}

bool calc(int x, int fa, int upper) {
//	printf("!%d %d\n", m1[x] - 1, upper);
	//upper = max(upper, m1[x] - 1);
	int lower = (s[x] == '1' ? 0 : +inf);
	
	int mx = 0;
	for (int v : g[x]) if (v != fa) {
	//	printf("%d->%d %d\n", v, x, mx);
		if (calc(v, x, max(upper, v != son[x] ? m1[x] : m2[x]) + 1)) {
			lower = min(lower, m1[v] + 1);
		}
		mx = m1[v] + 1;
	}

	
	if (fa == 0) upper = m1[x] + 1;
	upper = min(upper - 1, m1[x] + 1);
	//printf("%d %d %d\n", x, lower, upper);
	if (lower <= upper) ans += upper - lower + 1;
	return lower != inf;
}

bool cmp(int i, int j) { return m1[i] < m1[j]; }

int main() {
	scanf("%d", &n);
	iter(i, n - 1) {
		int x, y;
		scanf("%d%d", &x, &y);
		g[x].push_back(y);
		g[y].push_back(x);
	}
	scanf("%s", s + 1);
	int root;
	iter(i, n) if (s[i] == '1') root = i;
	dfs(root, 0);
	iter(i, n) sort(g[i].begin(), g[i].end(), cmp);
	
	calc(root, 0, 0);
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Submission Time
Task F - Black Radius
User Ketsui
Language C++14 (GCC 5.4.1)
Score 1900
Code Size 1561 Byte
Status AC
Exec Time 134 ms
Memory 27008 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:59:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
                        ^
./Main.cpp:63:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", s + 1);
                    ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 1300 / 1300 600 / 600
Status
AC × 3
AC × 31
AC × 81
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 5504 KB
0_01.txt AC 3 ms 5504 KB
0_02.txt AC 3 ms 5504 KB
1_00.txt AC 3 ms 5504 KB
1_01.txt AC 132 ms 25344 KB
1_02.txt AC 128 ms 23168 KB
1_03.txt AC 111 ms 13824 KB
1_04.txt AC 111 ms 14200 KB
1_05.txt AC 78 ms 13812 KB
1_06.txt AC 126 ms 13952 KB
1_07.txt AC 109 ms 13952 KB
1_08.txt AC 105 ms 15488 KB
1_09.txt AC 112 ms 18560 KB
1_10.txt AC 117 ms 22528 KB
1_11.txt AC 133 ms 24704 KB
1_12.txt AC 104 ms 16768 KB
1_13.txt AC 111 ms 17920 KB
1_14.txt AC 102 ms 16256 KB
1_15.txt AC 102 ms 15104 KB
1_16.txt AC 113 ms 16256 KB
1_17.txt AC 112 ms 20096 KB
1_18.txt AC 106 ms 13696 KB
1_19.txt AC 99 ms 13824 KB
1_20.txt AC 110 ms 13824 KB
1_21.txt AC 109 ms 14592 KB
1_22.txt AC 103 ms 14076 KB
1_23.txt AC 97 ms 13948 KB
1_24.txt AC 104 ms 15104 KB
1_25.txt AC 100 ms 15864 KB
1_26.txt AC 94 ms 13820 KB
1_27.txt AC 98 ms 14200 KB
1_28.txt AC 91 ms 14584 KB
1_29.txt AC 105 ms 18428 KB
2_00.txt AC 3 ms 5504 KB
2_01.txt AC 131 ms 22528 KB
2_02.txt AC 134 ms 26112 KB
2_03.txt AC 118 ms 27008 KB
2_04.txt AC 130 ms 23424 KB
2_05.txt AC 127 ms 23296 KB
2_06.txt AC 122 ms 19968 KB
2_07.txt AC 113 ms 13824 KB
2_08.txt AC 115 ms 13824 KB
2_09.txt AC 108 ms 13824 KB
2_10.txt AC 90 ms 14200 KB
2_11.txt AC 97 ms 14200 KB
2_12.txt AC 97 ms 14200 KB
2_13.txt AC 73 ms 13812 KB
2_14.txt AC 75 ms 13812 KB
2_15.txt AC 79 ms 13812 KB
2_16.txt AC 106 ms 13952 KB
2_17.txt AC 119 ms 13952 KB
2_18.txt AC 100 ms 13952 KB
2_19.txt AC 103 ms 13952 KB
2_20.txt AC 100 ms 13952 KB
2_21.txt AC 102 ms 13952 KB
2_22.txt AC 112 ms 15488 KB
2_23.txt AC 104 ms 14720 KB
2_24.txt AC 123 ms 15104 KB
2_25.txt AC 114 ms 19200 KB
2_26.txt AC 110 ms 20992 KB
2_27.txt AC 117 ms 20736 KB
2_28.txt AC 133 ms 20096 KB
2_29.txt AC 125 ms 22912 KB
2_30.txt AC 112 ms 20608 KB
2_31.txt AC 129 ms 18816 KB
2_32.txt AC 101 ms 14336 KB
2_33.txt AC 107 ms 16640 KB
2_34.txt AC 113 ms 16640 KB
2_35.txt AC 114 ms 20736 KB
2_36.txt AC 109 ms 13696 KB
2_37.txt AC 109 ms 13824 KB
2_38.txt AC 103 ms 14720 KB
2_39.txt AC 112 ms 13952 KB
2_40.txt AC 98 ms 14072 KB
2_41.txt AC 101 ms 13952 KB
2_42.txt AC 96 ms 13944 KB
2_43.txt AC 130 ms 17920 KB
2_44.txt AC 90 ms 14072 KB
2_45.txt AC 87 ms 14328 KB
2_46.txt AC 85 ms 14580 KB
2_47.txt AC 100 ms 17400 KB