Submission #1839953


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 PMIN[MAX];
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];
		PMIN[to] = min(pmin + 1, PMIN[v] + 1);
		if (i + 1 != SZ(g[v])) PMIN[to] = min(PMIN[to], SMIN[v][i + 1] + 1);

		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, PMIN[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
	PMIN[0] = INF;
	PMAX[0] = -INF;
	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;
	}
#endif

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

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

Submission Info

Submission Time
Task F - Black Radius
User vjudge5
Language C++14 (Clang 3.8.0)
Score 0
Code Size 3806 Byte
Status WA
Exec Time 491 ms
Memory 49020 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 1300 0 / 600
Status
AC × 3
AC × 20
WA × 11
AC × 32
WA × 49
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 16640 KB
0_01.txt AC 6 ms 16640 KB
0_02.txt AC 6 ms 16640 KB
1_00.txt WA 6 ms 16640 KB
1_01.txt AC 471 ms 49020 KB
1_02.txt AC 478 ms 44796 KB
1_03.txt AC 459 ms 37244 KB
1_04.txt AC 429 ms 32888 KB
1_05.txt WA 361 ms 28148 KB
1_06.txt WA 442 ms 31100 KB
1_07.txt AC 439 ms 31228 KB
1_08.txt AC 431 ms 32124 KB
1_09.txt AC 458 ms 38396 KB
1_10.txt AC 457 ms 39488 KB
1_11.txt AC 452 ms 47936 KB
1_12.txt AC 431 ms 35008 KB
1_13.txt WA 455 ms 38908 KB
1_14.txt AC 441 ms 34812 KB
1_15.txt AC 438 ms 33788 KB
1_16.txt WA 444 ms 37116 KB
1_17.txt AC 457 ms 40956 KB
1_18.txt AC 428 ms 34940 KB
1_19.txt WA 434 ms 32892 KB
1_20.txt WA 436 ms 35904 KB
1_21.txt AC 443 ms 37372 KB
1_22.txt AC 438 ms 32184 KB
1_23.txt WA 430 ms 31864 KB
1_24.txt AC 437 ms 32124 KB
1_25.txt AC 424 ms 34808 KB
1_26.txt AC 408 ms 30268 KB
1_27.txt WA 418 ms 29944 KB
1_28.txt WA 395 ms 29560 KB
1_29.txt WA 449 ms 33848 KB
2_00.txt AC 6 ms 16640 KB
2_01.txt AC 480 ms 48508 KB
2_02.txt AC 458 ms 46716 KB
2_03.txt AC 479 ms 46076 KB
2_04.txt AC 458 ms 42876 KB
2_05.txt AC 460 ms 43132 KB
2_06.txt AC 468 ms 43900 KB
2_07.txt WA 491 ms 37116 KB
2_08.txt WA 451 ms 37116 KB
2_09.txt AC 440 ms 37116 KB
2_10.txt WA 421 ms 32888 KB
2_11.txt WA 410 ms 32888 KB
2_12.txt WA 411 ms 32888 KB
2_13.txt AC 378 ms 28148 KB
2_14.txt AC 352 ms 28148 KB
2_15.txt WA 348 ms 28148 KB
2_16.txt WA 430 ms 31228 KB
2_17.txt WA 428 ms 31100 KB
2_18.txt WA 441 ms 31100 KB
2_19.txt WA 444 ms 31228 KB
2_20.txt WA 443 ms 31228 KB
2_21.txt WA 444 ms 31228 KB
2_22.txt WA 431 ms 31996 KB
2_23.txt WA 440 ms 32636 KB
2_24.txt WA 441 ms 32380 KB
2_25.txt WA 444 ms 38908 KB
2_26.txt WA 453 ms 37628 KB
2_27.txt WA 456 ms 38780 KB
2_28.txt WA 443 ms 38140 KB
2_29.txt WA 459 ms 46716 KB
2_30.txt WA 460 ms 43004 KB
2_31.txt WA 455 ms 39800 KB
2_32.txt WA 434 ms 31868 KB
2_33.txt WA 440 ms 35196 KB
2_34.txt WA 439 ms 37952 KB
2_35.txt WA 439 ms 43456 KB
2_36.txt WA 452 ms 36220 KB
2_37.txt WA 444 ms 34808 KB
2_38.txt WA 424 ms 33660 KB
2_39.txt WA 447 ms 37116 KB
2_40.txt WA 428 ms 32504 KB
2_41.txt WA 439 ms 31356 KB
2_42.txt WA 407 ms 32504 KB
2_43.txt WA 457 ms 38268 KB
2_44.txt WA 397 ms 29688 KB
2_45.txt WA 372 ms 29300 KB
2_46.txt WA 387 ms 29556 KB
2_47.txt WA 426 ms 34296 KB