oj.uz

Submission #879584

# Submission time Handle Problem Language Result Execution time Memory
879584 2023-11-27T16:36:44 Z Shayan86 The Xana coup (BOI21_xanadu) C++14
100 / 100
 39 ms 20572 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

const ll N = 1e5 + 50;
const ll inf = 1e18;

ll n, col[N], dp[N][2][2], tmp[2][2];

vector<int> adj[N];

void dfs(int v, int p = 0){
    for(int i = 0; i < 2; i++){
        for(int j = 0; j < 2; j++){
            dp[v][i][j] = inf;
        }
    }
    dp[v][col[v]][0] = 0;
    dp[v][1-col[v]][1] = 1;

    for(int u: adj[v]){
        if(u == p) continue;
        dfs(u, v);
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                tmp[i][j] = inf;
            }
        }
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                for(int k = 0; k < 2; k++){
                    tmp[i][j] = min(tmp[i][j], dp[u][j][k] + dp[v][i^k][j]);
                }
            }
        }
        for(int i = 0; i < 2; i++){
            for(int j = 0; j < 2; j++){
                dp[v][i][j] = tmp[i][j];
            }
        }
    }
}

int main(){
    fast_io;

    cin >> n;

    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    for(int i = 1; i <= n; i++) cin >> col[i];

    dfs(1);

    ll res = min(dp[1][0][0], dp[1][0][1]);

    if(res >= inf) kill("impossible");
    cout << res;

}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 20304 KB Output is correct
2 Correct 34 ms 20048 KB Output is correct
3 Correct 35 ms 20564 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 20400 KB Output is correct
2 Correct 33 ms 20052 KB Output is correct
3 Correct 35 ms 20312 KB Output is correct
4 Correct 26 ms 10328 KB Output is correct
5 Correct 30 ms 10816 KB Output is correct
6 Correct 30 ms 11096 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 10 ms 6492 KB Output is correct
9 Correct 32 ms 10892 KB Output is correct
10 Correct 35 ms 11096 KB Output is correct
11 Correct 32 ms 11600 KB Output is correct
12 Correct 39 ms 11856 KB Output is correct
13 Correct 29 ms 10584 KB Output is correct
14 Correct 35 ms 11100 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 1 ms 4744 KB Output is correct
8 Correct 1 ms 4952 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4748 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4748 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 35 ms 20304 KB Output is correct
18 Correct 34 ms 20048 KB Output is correct
19 Correct 35 ms 20564 KB Output is correct
20 Correct 36 ms 20400 KB Output is correct
21 Correct 33 ms 20052 KB Output is correct
22 Correct 35 ms 20312 KB Output is correct
23 Correct 26 ms 10328 KB Output is correct
24 Correct 30 ms 10816 KB Output is correct
25 Correct 30 ms 11096 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 10 ms 6492 KB Output is correct
28 Correct 32 ms 10892 KB Output is correct
29 Correct 35 ms 11096 KB Output is correct
30 Correct 32 ms 11600 KB Output is correct
31 Correct 39 ms 11856 KB Output is correct
32 Correct 29 ms 10584 KB Output is correct
33 Correct 35 ms 11100 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4748 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4696 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 4748 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4700 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 34 ms 20280 KB Output is correct
46 Correct 34 ms 20060 KB Output is correct
47 Correct 34 ms 20572 KB Output is correct
48 Correct 28 ms 10312 KB Output is correct
49 Correct 31 ms 11004 KB Output is correct
50 Correct 31 ms 11092 KB Output is correct
51 Correct 1 ms 4772 KB Output is correct
52 Correct 10 ms 6492 KB Output is correct
53 Correct 31 ms 11148 KB Output is correct
54 Correct 32 ms 11100 KB Output is correct
55 Correct 33 ms 11744 KB Output is correct
56 Correct 32 ms 11868 KB Output is correct
57 Correct 29 ms 10436 KB Output is correct
58 Correct 32 ms 11092 KB Output is correct
59 Correct 10 ms 6488 KB Output is correct
60 Correct 28 ms 10512 KB Output is correct
61 Correct 34 ms 11092 KB Output is correct
62 Correct 35 ms 11100 KB Output is correct
63 Correct 31 ms 11100 KB Output is correct
64 Correct 32 ms 11184 KB Output is correct
65 Correct 30 ms 11604 KB Output is correct
66 Correct 29 ms 11604 KB Output is correct
67 Correct 25 ms 11464 KB Output is correct
68 Correct 24 ms 11476 KB Output is correct
69 Correct 25 ms 11420 KB Output is correct
70 Correct 25 ms 11464 KB Output is correct