oj.uz

답안 #551348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
551348 2022-04-20T13:24:32 Z ivan24 The Xana coup (BOI21_xanadu) C++14
100 / 100
 170 ms 29044 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define F first
#define S second

ll min(ll x, ll y){
    return ((x < y) ? x : y);
}

ll max (ll x, ll y){
    return ((x > y) ? x : y);
}

ll n;
vvi adjList;
vi on,p;
ll dp[2][2][100000];
const ll INF = 1e9;
// dp[works][isOn][node]

void dfs (ll v){
    for (auto u: adjList[v]){
        if (p[v] == u) continue;
        dfs(u);
    }
    for (ll isOn = 0; 2 > isOn; isOn++){
        ll ctr = 0, sum = 0;
        bool bawal = false;
        vi diff;
        for (auto u: adjList[v]){
            if (p[v] == u) continue;
            if (dp[1-isOn][0][u] != INF && dp[1-isOn][1][u] == INF){
                sum += dp[1-isOn][0][u];
            }else if (dp[1-isOn][1][u] != INF && dp[1-isOn][0][u] == INF){
                sum += dp[1-isOn][1][u];
                ctr++;
            }else if (dp[1-isOn][1][u] == INF && dp[1-isOn][0][u] == INF){
                bawal = true;
                //cout << u << endl;
            }else{
                sum += dp[1-isOn][0][u];
                diff.push_back(dp[1-isOn][1][u]-dp[1-isOn][0][u]);
            }
        }
        if (bawal) continue;
        ctr %= 2;
        ll works = (ctr+on[v]+isOn)%2;
        dp[works][isOn][v] = min(sum+isOn,dp[works][isOn][v]);
        if (!diff.empty()){
            sort(diff.begin(),diff.end());
            for (ll i = 0; diff.size() > i; i++){
                works++; works %= 2;
                sum += diff[i];
                dp[works][isOn][v] = min(sum+isOn,dp[works][isOn][v]);
            }
        }

    }
}

void set_p(ll v){
    for (auto u: adjList[v]){
        if (p[v] == u) continue;
        p[u] = v; set_p(u);
    }
    for (ll i = 0; 4 > i; i++)
        dp[i/2][i%2][v] = INF;
}

int main(){
    cin >> n;
    adjList.resize(n);
    for (ll i = 0; n-1 > i; i++){
        ll u,v; cin >> u >> v;
        u--; v--;
        adjList[u].push_back(v);
        adjList[v].push_back(u);
    }
    on.resize(n);
    for (auto &i: on){
        cin >> i; i = 1-i;
    }
    p.assign(n,-1);
    set_p(0);
    dfs(0);
    /*
    for (ll v = 0; n > v; v++){
        for (ll i = 0; 2 > i; i++){
            for (ll j = 0; 2 > j; j++) cout << dp[i][j][v] << " ";
        }
        cout << "\n";
    }
    */
    ll res = min(dp[1][1][0], dp[1][0][0]);
    if (res == INF) cout << "impossible\n";
    else cout << res << "\n";
}

Compilation message

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 27440 KB Output is correct
2 Correct 120 ms 28644 KB Output is correct
3 Correct 114 ms 29044 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 27472 KB Output is correct
2 Correct 161 ms 28492 KB Output is correct
3 Correct 120 ms 28988 KB Output is correct
4 Correct 138 ms 11336 KB Output is correct
5 Correct 148 ms 12440 KB Output is correct
6 Correct 147 ms 12604 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 32 ms 4428 KB Output is correct
9 Correct 149 ms 12376 KB Output is correct
10 Correct 127 ms 12576 KB Output is correct
11 Correct 151 ms 13332 KB Output is correct
12 Correct 154 ms 13812 KB Output is correct
13 Correct 120 ms 12108 KB Output is correct
14 Correct 146 ms 12980 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 147 ms 27440 KB Output is correct
18 Correct 120 ms 28644 KB Output is correct
19 Correct 114 ms 29044 KB Output is correct
20 Correct 107 ms 27472 KB Output is correct
21 Correct 161 ms 28492 KB Output is correct
22 Correct 120 ms 28988 KB Output is correct
23 Correct 138 ms 11336 KB Output is correct
24 Correct 148 ms 12440 KB Output is correct
25 Correct 147 ms 12604 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 32 ms 4428 KB Output is correct
28 Correct 149 ms 12376 KB Output is correct
29 Correct 127 ms 12576 KB Output is correct
30 Correct 151 ms 13332 KB Output is correct
31 Correct 154 ms 13812 KB Output is correct
32 Correct 120 ms 12108 KB Output is correct
33 Correct 146 ms 12980 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 312 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 304 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 128 ms 28924 KB Output is correct
46 Correct 144 ms 28548 KB Output is correct
47 Correct 131 ms 29040 KB Output is correct
48 Correct 116 ms 11400 KB Output is correct
49 Correct 149 ms 12464 KB Output is correct
50 Correct 144 ms 12596 KB Output is correct
51 Correct 1 ms 308 KB Output is correct
52 Correct 32 ms 4412 KB Output is correct
53 Correct 144 ms 12292 KB Output is correct
54 Correct 170 ms 12580 KB Output is correct
55 Correct 146 ms 13396 KB Output is correct
56 Correct 157 ms 13956 KB Output is correct
57 Correct 123 ms 12140 KB Output is correct
58 Correct 137 ms 12984 KB Output is correct
59 Correct 35 ms 4344 KB Output is correct
60 Correct 117 ms 11152 KB Output is correct
61 Correct 135 ms 12304 KB Output is correct
62 Correct 147 ms 12500 KB Output is correct
63 Correct 136 ms 12488 KB Output is correct
64 Correct 157 ms 12444 KB Output is correct
65 Correct 126 ms 12856 KB Output is correct
66 Correct 121 ms 12812 KB Output is correct
67 Correct 98 ms 12612 KB Output is correct
68 Correct 112 ms 12572 KB Output is correct
69 Correct 100 ms 12584 KB Output is correct
70 Correct 98 ms 12512 KB Output is correct