oj.uz

Submission #871410

# Submission time Handle Problem Language Result Execution time Memory
871410 2023-11-10T18:40:46 Z Cyber_Wolf The Xana coup (BOI21_xanadu) C++17
0 / 100
 77 ms 13544 KB 
#include <bits/stdc++.h>

using namespace std;

#define lg long long 
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const lg N = 2e5+5;

vector<lg> adj[N];
lg dp[N][2], col[N];

// lg solve(lg src, lg b, lg par)
// {
	// auto&ret = dp[src][b];
	// if(~ret)	return ret;
	// ret = 1e18;
	// for(int i = 0; i < (1ll << adj[src].size()); i++)
	// {
		// lg x = (b^(__builtin_popcount(i)&1));
		// for(int j = 0; j < adj[src].size(); j++)
		// {
// 			
		// }
	// }
	// return ret;
// }

//par true -> must
//par false -> must not

int main()
{
	lg n;
	cin >> n;
	for(int i = 1; i < n; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	// lg ans = 1e18;
	// for(int i = 1; i <= n; i++)
	// {
		// memset(dp, -1, sizeof(dp));
		// ans = min(ans, dfs(i, 0, -1));
	// }
	for(int i = 1; i <= n; i++)
	{
		cin >> col[i];
		if(!col[i])
		{
			dp[i][0] = dp[i-1][0];
			dp[i][1] = dp[i-1][1]+1;
		}
		else{
			dp[i][0] = dp[i-1][1]+1;
			dp[i][1] = dp[i-1][0];
		}
	}
	cout << dp[n][0] << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 13544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 62 ms 13236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5468 KB Output isn't correct
2 Halted 0 ms 0 KB -