oj.uz

Submission #705863

# Submission time Handle Problem Language Result Execution time Memory
705863 2023-03-05T14:22:41 Z Chal1shkan The Xana coup (BOI21_xanadu) C++14
100 / 100
 67 ms 20428 KB 
# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define deb(x) cerr << #x  << " = " << x << endl; 
# define pll pair <ll, ll>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = 1e5 + 25;
const ll inf = 2e9 + 0;
const ll mod = 1e9 + 123;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;

ll n, col[maxn];
vector <ll> g[maxn];
ll dp[maxn][2][2];

void dfs (ll v, ll pa)
{
	ll tmp[2][2];
	tmp[0][0] = 0;
	tmp[1][0] = 0;
	tmp[0][1] = inf;
	tmp[1][1] = inf;
	for (ll to : g[v])
	{
		if (to == pa) continue;
		dfs(to, v);
		ll t[2][2];
		t[0][0] = min(tmp[0][1] + dp[to][0][1], tmp[0][0] + dp[to][0][0]);
		t[0][1] = min(tmp[0][0] + dp[to][0][1], tmp[0][1] + dp[to][0][0]);
		t[1][0] = min(tmp[1][1] + dp[to][1][1], tmp[1][0] + dp[to][1][0]);
		t[1][1] = min(tmp[1][0] + dp[to][1][1], tmp[1][1] + dp[to][1][0]);
		for (ll i = 0; i < 2; ++i) 
		{
			for (ll j = 0; j < 2; ++j)
			{
				tmp[i][j] = t[i][j];
			}
		}
	}
	if (col[v])
    {
        dp[v][0][0] = tmp[0][1];
        dp[v][0][1] = 1 + tmp[1][0];
        dp[v][1][0] = tmp[0][0];
        dp[v][1][1] = 1 + tmp[1][1];
    }
    else 
	{
        dp[v][0][0] = tmp[0][0];
        dp[v][0][1] = 1 + tmp[1][1];
        dp[v][1][0] = tmp[0][1];
        dp[v][1][1] = 1 + tmp[1][0];
    }
}

void ma1n (/* SABR */)
{
	cin >> n;
	for (ll i = 1, u, v; i < n; ++i)
	{
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	for (ll i = 1; i <= n; ++i)
	{
		cin >> col[i];
	}
	dfs(1, 1);
	ll ans = min({dp[1][0][1], dp[1][0][0]});
	if (ans >= inf) cout << "impossible" << nl;
	else cout << ans << nl;
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("angry.in", "r", stdin);
// freopen("angry.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << ' ';
        ma1n();
    }
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 19012 KB Output is correct
2 Correct 46 ms 18836 KB Output is correct
3 Correct 46 ms 19284 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 19020 KB Output is correct
2 Correct 58 ms 18828 KB Output is correct
3 Correct 47 ms 19148 KB Output is correct
4 Correct 42 ms 9624 KB Output is correct
5 Correct 56 ms 11720 KB Output is correct
6 Correct 49 ms 11924 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 14 ms 5588 KB Output is correct
9 Correct 51 ms 11504 KB Output is correct
10 Correct 56 ms 11648 KB Output is correct
11 Correct 53 ms 11956 KB Output is correct
12 Correct 52 ms 12344 KB Output is correct
13 Correct 45 ms 11516 KB Output is correct
14 Correct 54 ms 12152 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2676 KB Output is correct
9 Correct 2 ms 2680 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 48 ms 19012 KB Output is correct
18 Correct 46 ms 18836 KB Output is correct
19 Correct 46 ms 19284 KB Output is correct
20 Correct 44 ms 19020 KB Output is correct
21 Correct 58 ms 18828 KB Output is correct
22 Correct 47 ms 19148 KB Output is correct
23 Correct 42 ms 9624 KB Output is correct
24 Correct 56 ms 11720 KB Output is correct
25 Correct 49 ms 11924 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 14 ms 5588 KB Output is correct
28 Correct 51 ms 11504 KB Output is correct
29 Correct 56 ms 11648 KB Output is correct
30 Correct 53 ms 11956 KB Output is correct
31 Correct 52 ms 12344 KB Output is correct
32 Correct 45 ms 11516 KB Output is correct
33 Correct 54 ms 12152 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2684 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 1 ms 2680 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2664 KB Output is correct
41 Correct 2 ms 2684 KB Output is correct
42 Correct 2 ms 2684 KB Output is correct
43 Correct 2 ms 2684 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 48 ms 20352 KB Output is correct
46 Correct 46 ms 20108 KB Output is correct
47 Correct 48 ms 20428 KB Output is correct
48 Correct 43 ms 10884 KB Output is correct
49 Correct 49 ms 11668 KB Output is correct
50 Correct 50 ms 11924 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 15 ms 5588 KB Output is correct
53 Correct 49 ms 11540 KB Output is correct
54 Correct 59 ms 11632 KB Output is correct
55 Correct 67 ms 12028 KB Output is correct
56 Correct 53 ms 12372 KB Output is correct
57 Correct 55 ms 11668 KB Output is correct
58 Correct 48 ms 12236 KB Output is correct
59 Correct 14 ms 5532 KB Output is correct
60 Correct 42 ms 10628 KB Output is correct
61 Correct 48 ms 11412 KB Output is correct
62 Correct 47 ms 11596 KB Output is correct
63 Correct 53 ms 11656 KB Output is correct
64 Correct 57 ms 11532 KB Output is correct
65 Correct 44 ms 12060 KB Output is correct
66 Correct 50 ms 12072 KB Output is correct
67 Correct 46 ms 11768 KB Output is correct
68 Correct 36 ms 11832 KB Output is correct
69 Correct 34 ms 11848 KB Output is correct
70 Correct 34 ms 11816 KB Output is correct