Submission #5646976


Source Code Expand

#include <algorithm>
#include <cstring>
#include <cstdio>
int val[100005], app[25], seq[25];
int dp[100005], pop[100005], sum[100005];
int main()
{
	// freopen("E.in", "r", stdin);
	int n, m = 0, ans = 0;
	scanf("%d", &n);
	for (int i = 1; i < n; i++)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		val[u] ^= w;
		val[v] ^= w;
	}
	for (int i = 0; i < n; i++)
		app[val[i]]++;
	for (int i = 1; i < 16; i++)
	{
		ans += app[i] >> 1;
		if (app[i] & 1)
			seq[m++] = i;
	}
	for (int i = 1; i < 1 << m; i++)
	{
		pop[i] = pop[i ^ (i & -i)] + 1;
		for (int j = 0; j < m; j++)
		{
			if (i & (1 << j))
				sum[i] ^= seq[j];
		}
	}
	memset(dp, 0x3f, sizeof(dp));
	dp[0] = 0;
	for (int i = 0; i + 1 < 1 << m; i++)
	{
		int rem = (1 << m) - 1 ^ i, low = rem & -rem;
		for (int j = rem ^ low; ; j = j - 1 & (rem ^ low))
		{
			int add = j | low;
			if (!sum[add])
				dp[i | add] = std::min(dp[i | add], dp[i] + pop[j]);
			if (!j)
				break;
		}
	}
	printf("%d\n", ans + dp[(1 << m) - 1]);
	return 0;
}

Submission Info

Submission Time
Task F - XOR Tree
User diamond_duke
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1048 Byte
Status AC
Exec Time 38 ms
Memory 1152 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:14:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 43
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 512 KB
0_001.txt AC 1 ms 512 KB
1_002.txt AC 22 ms 896 KB
1_003.txt AC 23 ms 896 KB
1_004.txt AC 23 ms 896 KB
1_005.txt AC 23 ms 896 KB
1_006.txt AC 23 ms 896 KB
1_007.txt AC 23 ms 896 KB
1_008.txt AC 23 ms 896 KB
1_009.txt AC 23 ms 896 KB
1_010.txt AC 23 ms 896 KB
1_011.txt AC 23 ms 896 KB
1_012.txt AC 23 ms 896 KB
1_013.txt AC 23 ms 896 KB
1_014.txt AC 23 ms 896 KB
1_015.txt AC 23 ms 896 KB
1_016.txt AC 23 ms 1024 KB
1_017.txt AC 23 ms 896 KB
1_018.txt AC 23 ms 896 KB
1_019.txt AC 23 ms 896 KB
1_020.txt AC 23 ms 896 KB
1_021.txt AC 23 ms 896 KB
1_022.txt AC 23 ms 896 KB
1_023.txt AC 38 ms 1152 KB
1_024.txt AC 23 ms 1024 KB
1_025.txt AC 23 ms 1024 KB
1_026.txt AC 23 ms 1024 KB
1_027.txt AC 23 ms 896 KB
1_028.txt AC 23 ms 1024 KB
1_029.txt AC 23 ms 1024 KB
1_030.txt AC 23 ms 896 KB
1_031.txt AC 23 ms 896 KB
1_032.txt AC 23 ms 896 KB
1_033.txt AC 23 ms 896 KB
1_034.txt AC 23 ms 896 KB
1_035.txt AC 23 ms 896 KB
1_036.txt AC 23 ms 896 KB
1_037.txt AC 23 ms 896 KB
1_038.txt AC 23 ms 896 KB
1_039.txt AC 23 ms 896 KB
1_040.txt AC 23 ms 896 KB
1_041.txt AC 23 ms 896 KB
1_042.txt AC 23 ms 896 KB