Submission #1833652


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <ctime>
#include<complex>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;


const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;

const int MAX = 2 * 1000 * 100 + 47;
const int MOD = 1000 * 1000 * 1000 + 7;

vector<int> g[MAX];
vector<int> SMIN[MAX];
vector<int> SMAX[MAX];
string s;
int PMAX[MAX];
int P[MAX];
int CNT[MAX];
int H[MAX];

void dfs(int v, int p)
{
	int ind = -1;
	FOR(i, 0, SZ(g[v]))
	{
		if (g[v][i] == p)
		{
			ind = i;
			break;
		}
	}

	if (ind != -1)
	{
		g[v].erase(g[v].begin() + ind);
	}
	
	CNT[v] = s[v] == '1';
	FOR(i, 0, SZ(g[v]))
	{
		int to = g[v][i];
		dfs(to, v);
		H[v] = max(H[v], H[to] + 1);
		CNT[v] += CNT[to];
	}
}

void dfs1(int v)
{
	int pmax = -INF;
	int pmin = INF;

	FOR(i, 0, SZ(g[v]))
	{
		int to = g[v][i];

		PMAX[to] = max(pmax + 1, PMAX[v] + 1);
		if (i + 1 != SZ(g[v])) PMAX[to] = max(PMAX[to], SMAX[v][i + 1] + 1);

		pmax = max(pmax, H[to] + 1);
		pmin = min(pmin, H[to] + 1);
	}

	FOR(i, 0, SZ(g[v]))
	{
		int to = g[v][i];
		dfs1(to);
	}
}

vector<int> A;
int getMax2(int v)
{
	A.clear();
	A.push_back(PMAX[v]);
	FOR(i, 0, SZ(g[v]))
	{
		int to = g[v][i];
		A.push_back(H[to] + 1);
	}

	sort(ALL(A));
	reverse(ALL(A));
	if (SZ(g[v]) == 0)
	{
		if (A[0] > 1) return 1;
		return 0;
	}

	int ans = A[1] + 1;
	while (ans >= A[0]) ans--;

	return ans;
}

int getMin(int v)
{
	int ans = INF;
	if (CNT[0] != CNT[v])
	{
		ans = min(ans, PMAX[v]);
	}

	FOR(i, 0, SZ(g[v]))
	{
		int to = g[v][i];
		if (CNT[to] != 0)
		{
			ans = min(ans, H[to] + 1);
		}
	}


	return ans;
}

//#define DEBUG
int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	ios::sync_with_stdio(false); cin.tie(0);
	int n;
	cin >> n;
	FOR(i, 0, n - 1)
	{
		int a, b;
		cin >> a >> b;
		a--;
		b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}

	cin >> s;
	dfs(0, 0);
#ifdef DEBUG
	cout << "H=" << endl;
	FOR(i, 0, n)
	{
		cout << i + 1 << " " << H[i] << endl;
	}
#endif
	FOR(v, 0, n)
	{
		SMIN[v].assign(SZ(g[v]), INF);
		SMAX[v].assign(SZ(g[v]), -INF);

		RFOR(i, SZ(g[v]), 0)
		{
			int to = g[v][i];
			if (i + 1 != SZ(g[v])) SMIN[v][i] = SMIN[v][i + 1];
			SMIN[v][i] = min(SMIN[v][i], H[to] + 1);

			if (i + 1 != SZ(g[v])) SMAX[v][i] = SMAX[v][i + 1];
			SMAX[v][i] = max(SMAX[v][i], H[to] + 1);
		}
	}

#ifdef DEBUG
	cout << "SMAX" << endl;
	FOR(i, 0, n)
	{
		cout << i + 1 << ": ";
		FOR(j, 0, SZ(g[i]))
		{
			cout << SMAX[i][j] << " ";
		}
		cout << endl;
	}
#endif
	PMAX[0] = -INF;
	if (SZ(g[0]) == 1)
	{
		PMAX[0] = 0;
	}
	dfs1(0);
	LL ans = 0;
#ifdef DEBUG
	cout << "PMAX=" << endl;
	FOR(i, 0, n)
	{
		cout << i + 1 << " " << PMAX[i] << endl;
	}

	cout << "2max" << endl;
	FOR(i, 0, n)
	{
		cout << i + 1 << " " << getMax2(i) << endl;
	}

	cout << "min" << endl;
	FOR(i, 0, n)
	{
		cout << i + 1 << " " << getMin(i) << endl;
	}
#endif

	FOR(v, 0, SZ(s))
	{
		if (s[v] == '1')
		{
			ans += getMax2(v) + 1;
			continue;
		}

		//cout << "!!" << getMax2(v) << " " << getMin(v) << endl;
		ans += max(getMax2(v) - getMin(v) + 1, 0);
	}
	
	cout << ans + 1 << endl;
}

Submission Info

Submission Time
Task F - Black Radius
User philologist
Language C++14 (GCC 5.4.1)
Score 1900
Code Size 4108 Byte
Status AC
Exec Time 236 ms
Memory 47888 KB

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 6 ms 15488 KB
0_01.txt AC 6 ms 15360 KB
0_02.txt AC 6 ms 15360 KB
1_00.txt AC 6 ms 15488 KB
1_01.txt AC 161 ms 47888 KB
1_02.txt AC 155 ms 43664 KB
1_03.txt AC 174 ms 35984 KB
1_04.txt AC 115 ms 31608 KB
1_05.txt AC 77 ms 26996 KB
1_06.txt AC 130 ms 29968 KB
1_07.txt AC 132 ms 29964 KB
1_08.txt AC 135 ms 30992 KB
1_09.txt AC 148 ms 37264 KB
1_10.txt AC 146 ms 38280 KB
1_11.txt AC 166 ms 46740 KB
1_12.txt AC 131 ms 33800 KB
1_13.txt AC 148 ms 37652 KB
1_14.txt AC 133 ms 33672 KB
1_15.txt AC 131 ms 32648 KB
1_16.txt AC 138 ms 35852 KB
1_17.txt AC 149 ms 39688 KB
1_18.txt AC 139 ms 33808 KB
1_19.txt AC 132 ms 31632 KB
1_20.txt AC 147 ms 34704 KB
1_21.txt AC 170 ms 36232 KB
1_22.txt AC 124 ms 30988 KB
1_23.txt AC 137 ms 30608 KB
1_24.txt AC 135 ms 30984 KB
1_25.txt AC 128 ms 33528 KB
1_26.txt AC 123 ms 29052 KB
1_27.txt AC 123 ms 28792 KB
1_28.txt AC 104 ms 28280 KB
1_29.txt AC 132 ms 32520 KB
2_00.txt AC 6 ms 15488 KB
2_01.txt AC 236 ms 47376 KB
2_02.txt AC 178 ms 45456 KB
2_03.txt AC 185 ms 44944 KB
2_04.txt AC 173 ms 41744 KB
2_05.txt AC 204 ms 41872 KB
2_06.txt AC 181 ms 42768 KB
2_07.txt AC 162 ms 35980 KB
2_08.txt AC 162 ms 35984 KB
2_09.txt AC 161 ms 35984 KB
2_10.txt AC 128 ms 31608 KB
2_11.txt AC 122 ms 31608 KB
2_12.txt AC 130 ms 31608 KB
2_13.txt AC 82 ms 26996 KB
2_14.txt AC 86 ms 26996 KB
2_15.txt AC 83 ms 26996 KB
2_16.txt AC 141 ms 29968 KB
2_17.txt AC 146 ms 29968 KB
2_18.txt AC 170 ms 29968 KB
2_19.txt AC 129 ms 29968 KB
2_20.txt AC 162 ms 29968 KB
2_21.txt AC 137 ms 29968 KB
2_22.txt AC 135 ms 30860 KB
2_23.txt AC 135 ms 31376 KB
2_24.txt AC 149 ms 31248 KB
2_25.txt AC 161 ms 37648 KB
2_26.txt AC 158 ms 36496 KB
2_27.txt AC 149 ms 37644 KB
2_28.txt AC 143 ms 37000 KB
2_29.txt AC 181 ms 45576 KB
2_30.txt AC 169 ms 41864 KB
2_31.txt AC 173 ms 38536 KB
2_32.txt AC 179 ms 30728 KB
2_33.txt AC 153 ms 34064 KB
2_34.txt AC 161 ms 36744 KB
2_35.txt AC 175 ms 42248 KB
2_36.txt AC 187 ms 34956 KB
2_37.txt AC 153 ms 33548 KB
2_38.txt AC 138 ms 32392 KB
2_39.txt AC 161 ms 35860 KB
2_40.txt AC 138 ms 31352 KB
2_41.txt AC 141 ms 30216 KB
2_42.txt AC 125 ms 31352 KB
2_43.txt AC 156 ms 37012 KB
2_44.txt AC 115 ms 28536 KB
2_45.txt AC 96 ms 28020 KB
2_46.txt AC 112 ms 28280 KB
2_47.txt AC 157 ms 33144 KB