oj.uz

Submission #489683

# Submission time Handle Problem Language Result Execution time Memory
489683 2021-11-23T21:34:28 Z arwaeystoamneg The Xana coup (BOI21_xanadu) C++17
100 / 100
 66 ms 18472 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 111111;
int n;
vector<vi>adj;
vi a;
int dp[MAX][2][2];
void dfs(int i, int p = -1)
{
	if (i && sz(adj[i]) == 1)
	{
		dp[i][a[i]][0] = 0;
		dp[i][1 ^ a[i]][1] = 1;
		return;
	}
	trav(x, adj[i])
	{
		if (x == p)continue;
		dfs(x, i);
	}
	// if do not toggle point
	int cost[2] = { inf,inf }, ne[2] = { 0,0 };
	cost[a[i]] = 0;
	trav(x, adj[i])
	{
		if (x == p)continue;
		ne[0] = ne[1] = inf;
		F0R(j, 2)
		{
			ne[j] = min(ne[j], cost[j] + dp[x][0][0]);
			ne[j ^ 1] = min(ne[j ^ 1], cost[j] + dp[x][0][1]);
		}
		cost[0] = ne[0], cost[1] = ne[1];
	}
	dp[i][0][0] = cost[0];
	dp[i][1][0] = cost[1];
	// toggle point
	cost[0] = cost[1] = inf;
	cost[a[i]] = 1;
	trav(x, adj[i])
	{
		if (x == p)continue;
		ne[0] = ne[1] = inf;
		F0R(j, 2)
		{
			ne[j] = min(ne[j], cost[j] + dp[x][1][0]);
			ne[j ^ 1] = min(ne[j ^ 1], cost[j] + dp[x][1][1]);
		}
		cost[0] = ne[0], cost[1] = ne[1];
	}
	dp[i][1][1] = cost[0];
	dp[i][0][1] = cost[1];
}
int main()
{
	setIO("test1"); 
	cin >> n;
	a.rsz(n);
	adj.rsz(n);
	F0R(i, n - 1)
	{
		int x, y;
		cin >> x >> y;
		x--, y--;
		adj[x].pb(y);
		adj[y].pb(x);
	}
	trav(x, a)cin >> x;
	F0R(i, n)dp[i][0][0] = dp[i][0][1] = dp[i][1][0] = dp[i][1][1] = inf;
	dfs(0);
	int ans = min(dp[0][0][0], dp[0][0][1]);
	if (ans > n)cout << "impossible" << endl;
	else cout << ans << endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 18328 KB Output is correct
2 Correct 50 ms 18084 KB Output is correct
3 Correct 53 ms 18472 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 18400 KB Output is correct
2 Correct 48 ms 18044 KB Output is correct
3 Correct 49 ms 18384 KB Output is correct
4 Correct 43 ms 8132 KB Output is correct
5 Correct 46 ms 8836 KB Output is correct
6 Correct 47 ms 8988 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 13 ms 3272 KB Output is correct
9 Correct 49 ms 8972 KB Output is correct
10 Correct 55 ms 9264 KB Output is correct
11 Correct 46 ms 9540 KB Output is correct
12 Correct 50 ms 9924 KB Output is correct
13 Correct 41 ms 8492 KB Output is correct
14 Correct 48 ms 8968 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 54 ms 18328 KB Output is correct
18 Correct 50 ms 18084 KB Output is correct
19 Correct 53 ms 18472 KB Output is correct
20 Correct 66 ms 18400 KB Output is correct
21 Correct 48 ms 18044 KB Output is correct
22 Correct 49 ms 18384 KB Output is correct
23 Correct 43 ms 8132 KB Output is correct
24 Correct 46 ms 8836 KB Output is correct
25 Correct 47 ms 8988 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 13 ms 3272 KB Output is correct
28 Correct 49 ms 8972 KB Output is correct
29 Correct 55 ms 9264 KB Output is correct
30 Correct 46 ms 9540 KB Output is correct
31 Correct 50 ms 9924 KB Output is correct
32 Correct 41 ms 8492 KB Output is correct
33 Correct 48 ms 8968 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 47 ms 18372 KB Output is correct
46 Correct 47 ms 18116 KB Output is correct
47 Correct 46 ms 18456 KB Output is correct
48 Correct 44 ms 8040 KB Output is correct
49 Correct 46 ms 8784 KB Output is correct
50 Correct 47 ms 9028 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 13 ms 3276 KB Output is correct
53 Correct 54 ms 9152 KB Output is correct
54 Correct 47 ms 9124 KB Output is correct
55 Correct 47 ms 9512 KB Output is correct
56 Correct 50 ms 9920 KB Output is correct
57 Correct 41 ms 8524 KB Output is correct
58 Correct 44 ms 9104 KB Output is correct
59 Correct 13 ms 3220 KB Output is correct
60 Correct 41 ms 8184 KB Output is correct
61 Correct 46 ms 8968 KB Output is correct
62 Correct 48 ms 9156 KB Output is correct
63 Correct 48 ms 9148 KB Output is correct
64 Correct 55 ms 9104 KB Output is correct
65 Correct 37 ms 9512 KB Output is correct
66 Correct 37 ms 9640 KB Output is correct
67 Correct 34 ms 9476 KB Output is correct
68 Correct 34 ms 9408 KB Output is correct
69 Correct 35 ms 9404 KB Output is correct
70 Correct 36 ms 9404 KB Output is correct