oj.uz

Submission #924326

# Submission time Handle Problem Language Result Execution time Memory
924326 2024-02-08T20:47:16 Z vjudge1 The Xana coup (BOI21_xanadu) C++17
100 / 100
 115 ms 26624 KB 
#include <bits/stdc++.h>
 
#define ll long long
using namespace std;
#define pii pair<ll, ll>
ll oo = 1e9 + 9;
int n, m, k;
const int MAX = 1e5 + 5, MOD = 1e9 + 7, LOGMAX = 25;
 
vector<int> g[MAX];
int col[MAX];
 
int dp[MAX][2][2];
 
void dfs(int node, int p){
    dp[node][0][0] = oo;
    dp[node][0][1] = oo;
    dp[node][1][0] = oo;
    dp[node][1][1] = oo;
 
    int sum = 0, sum2 = 0;
    vector<int> s, s2;
    int p1 = 1, p2 = 1;
    for(int to : g[node]){
        if(p == to) continue;
        dfs(to, node);
        if(dp[to][0][0] <= n && dp[to][0][1] <= n){
            sum += dp[to][0][0];
            s.push_back(dp[to][0][1] - dp[to][0][0]);
        }
        else if(dp[to][0][0] <= n){
            sum += dp[to][0][0];
        }
        else{
            sum += dp[to][0][1];
            p1 ^= 1;
        }
        if(dp[to][1][0] <= n && dp[to][1][1] <= n){
            sum2 += dp[to][1][0];
            s2.push_back(dp[to][1][1] - dp[to][1][0]);
        }
        else if(dp[to][1][0] <= n){
            sum2 += dp[to][1][0];
        }
        else{
            sum2 += dp[to][1][1];
            p2 ^= 1;
        }
    }
    sort(s.begin(), s.end());
    sort(s2.begin(), s2.end());
    int pre = 0;
    if(p1){
        dp[node][1][0] = min(sum, dp[node][1][0]);
    }
    else{
        dp[node][0][0] = min(sum, dp[node][0][0]);
    }
    for(int i = 0; i < s.size(); i++){
        pre += s[i];
        if(i % 2 == p1){
            dp[node][1][0] = min(sum + pre, dp[node][1][0]);
        }
        else{
            dp[node][0][0] = min(sum + pre, dp[node][0][0]);
        }
    }
    pre = 0;
    if(p2){
        dp[node][0][1] = min(sum2, dp[node][0][1]);
    }
    else{
        dp[node][1][1] = min(sum2, dp[node][1][1]);
    }
    for(int i = 0; i < s2.size(); i++){
        pre += s2[i];
        if(i % 2 == p2){
            dp[node][0][1] = min(sum2 + pre, dp[node][0][1]); 
        }
        else{
            dp[node][1][1] = min(sum2 + pre, dp[node][1][1]);
        }
    }
    dp[node][1][1]++;
    dp[node][0][1]++;
    if(!col[node]){
        swap(dp[node][0][0], dp[node][1][0]);
        swap(dp[node][0][1], dp[node][1][1]);
    }
}
 
void solve(){
    cin >> n;
    for(int i = 1; i < n; i++){
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 1; i <= n; i++) cin >> col[i];
    dfs(1, 1);
    if(min(dp[1][0][0], dp[1][0][1]) > n){
        cout << "impossible\n";
    }
    else{
        cout << min(dp[1][0][0], dp[1][0][1]) << '\n';
    }
}
 
signed main(){
    int t = 1;
    for(int i = 1; i <= t; i++){
        solve();
    }
}

Compilation message

xanadu.cpp: In function 'void dfs(int, int)':
xanadu.cpp:59:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for(int i = 0; i < s.size(); i++){
      |                    ~~^~~~~~~~~~
xanadu.cpp:75:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = 0; i < s2.size(); i++){
      |                    ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 26276 KB Output is correct
2 Correct 76 ms 26200 KB Output is correct
3 Correct 88 ms 26532 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 26284 KB Output is correct
2 Correct 79 ms 26052 KB Output is correct
3 Correct 93 ms 26548 KB Output is correct
4 Correct 59 ms 7336 KB Output is correct
5 Correct 80 ms 7700 KB Output is correct
6 Correct 72 ms 7856 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 22 ms 5840 KB Output is correct
9 Correct 68 ms 7880 KB Output is correct
10 Correct 85 ms 7936 KB Output is correct
11 Correct 74 ms 9300 KB Output is correct
12 Correct 75 ms 9556 KB Output is correct
13 Correct 64 ms 7604 KB Output is correct
14 Correct 72 ms 7796 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 2 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 76 ms 26276 KB Output is correct
18 Correct 76 ms 26200 KB Output is correct
19 Correct 88 ms 26532 KB Output is correct
20 Correct 80 ms 26284 KB Output is correct
21 Correct 79 ms 26052 KB Output is correct
22 Correct 93 ms 26548 KB Output is correct
23 Correct 59 ms 7336 KB Output is correct
24 Correct 80 ms 7700 KB Output is correct
25 Correct 72 ms 7856 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 22 ms 5840 KB Output is correct
28 Correct 68 ms 7880 KB Output is correct
29 Correct 85 ms 7936 KB Output is correct
30 Correct 74 ms 9300 KB Output is correct
31 Correct 75 ms 9556 KB Output is correct
32 Correct 64 ms 7604 KB Output is correct
33 Correct 72 ms 7796 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 1 ms 4444 KB Output is correct
44 Correct 1 ms 4444 KB Output is correct
45 Correct 84 ms 26276 KB Output is correct
46 Correct 76 ms 26192 KB Output is correct
47 Correct 79 ms 26624 KB Output is correct
48 Correct 75 ms 7516 KB Output is correct
49 Correct 68 ms 7764 KB Output is correct
50 Correct 66 ms 7764 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 26 ms 5928 KB Output is correct
53 Correct 75 ms 7808 KB Output is correct
54 Correct 115 ms 7848 KB Output is correct
55 Correct 80 ms 9348 KB Output is correct
56 Correct 90 ms 9552 KB Output is correct
57 Correct 83 ms 7492 KB Output is correct
58 Correct 67 ms 7612 KB Output is correct
59 Correct 32 ms 5724 KB Output is correct
60 Correct 72 ms 7508 KB Output is correct
61 Correct 64 ms 7764 KB Output is correct
62 Correct 66 ms 7980 KB Output is correct
63 Correct 69 ms 7940 KB Output is correct
64 Correct 69 ms 7892 KB Output is correct
65 Correct 63 ms 8364 KB Output is correct
66 Correct 70 ms 8244 KB Output is correct
67 Correct 58 ms 8076 KB Output is correct
68 Correct 60 ms 8036 KB Output is correct
69 Correct 59 ms 8136 KB Output is correct
70 Correct 62 ms 8072 KB Output is correct