oj.uz

답안 #655266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
655266 2022-11-03T16:35:21 Z 600Mihnea The Xana coup (BOI21_xanadu) C++17
100 / 100
 83 ms 23172 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=(int)1e5+7;
const int INF=(int)1e9+7;
int n;
int v[N];
int cost[N][2][2];
int nw[2][2];
vector<int> g[N];

void minup(int &a,int b){
        a=min(a,b);
}

void dfs(int a,int p=-1){
        vector<int> kids;
        for (auto &b : g[a]){
                if (b==p){
                        continue;
                }
                kids.push_back(b);
                dfs(b,a);
        }
        g[a]=kids;
        cost[a][0][0]=cost[a][0][1]=cost[a][1][0]=cost[a][1][1]=INF;
        cost[a][0][v[a]]=0;
        cost[a][1][v[a]^1]=1;


        for (auto &b : g[a]){
                nw[0][0]=nw[0][1]=nw[1][0]=nw[1][1]=INF;
                for (int apply=0;apply<=1;apply++){
                        for(int cur=0;cur<=1;cur++){
                                for (int apply_b=0;apply_b<=1;apply_b++){
                                        for (int cur_b=0;cur_b<=1;cur_b++){
                                                if ((cur_b^apply)==0){
                                                        minup(nw[apply][cur^apply_b],cost[a][apply][cur]+cost[b][apply_b][cur_b]);
                                                }
                                        }
                                }
                        }
                }
                for(int i=0;i<=1;i++){
                        for (int j=0;j<=1;j++){
                                cost[a][i][j]=nw[i][j];
                        }
                }
        }
}

int main(){
        ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

        ///freopen("___input___.txt","r",stdin);

        cin>>n;
        for (int i=1;i<n;i++){
                int a,b;
                cin>>a>>b;
                g[a].push_back(b);
                g[b].push_back(a);
        }
        for (int i=1;i<=n;i++){
                cin>>v[i];
        }
        dfs(1);
        int sol=INF;
        for (int x=0;x<=1;x++){
                sol=min(sol,cost[1][x][0]);
        }
        if(sol==INF){
                cout<<"impossible\n";
                return 0;
        }
        cout<<sol<<"\n";
        return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 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 2688 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2684 KB Output is correct
16 Correct 2 ms 2684 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 23000 KB Output is correct
2 Correct 54 ms 22740 KB Output is correct
3 Correct 56 ms 23172 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 22988 KB Output is correct
2 Correct 54 ms 22748 KB Output is correct
3 Correct 55 ms 23156 KB Output is correct
4 Correct 46 ms 8472 KB Output is correct
5 Correct 50 ms 8868 KB Output is correct
6 Correct 53 ms 9036 KB Output is correct
7 Correct 1 ms 2684 KB Output is correct
8 Correct 17 ms 4820 KB Output is correct
9 Correct 52 ms 9020 KB Output is correct
10 Correct 62 ms 9272 KB Output is correct
11 Correct 83 ms 10136 KB Output is correct
12 Correct 65 ms 10344 KB Output is correct
13 Correct 55 ms 8708 KB Output is correct
14 Correct 56 ms 9092 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 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 2688 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2684 KB Output is correct
16 Correct 2 ms 2684 KB Output is correct
17 Correct 54 ms 23000 KB Output is correct
18 Correct 54 ms 22740 KB Output is correct
19 Correct 56 ms 23172 KB Output is correct
20 Correct 58 ms 22988 KB Output is correct
21 Correct 54 ms 22748 KB Output is correct
22 Correct 55 ms 23156 KB Output is correct
23 Correct 46 ms 8472 KB Output is correct
24 Correct 50 ms 8868 KB Output is correct
25 Correct 53 ms 9036 KB Output is correct
26 Correct 1 ms 2684 KB Output is correct
27 Correct 17 ms 4820 KB Output is correct
28 Correct 52 ms 9020 KB Output is correct
29 Correct 62 ms 9272 KB Output is correct
30 Correct 83 ms 10136 KB Output is correct
31 Correct 65 ms 10344 KB Output is correct
32 Correct 55 ms 8708 KB Output is correct
33 Correct 56 ms 9092 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2684 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 1 ms 2688 KB Output is correct
38 Correct 1 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 1 ms 2684 KB Output is correct
42 Correct 2 ms 2684 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 56 ms 23064 KB Output is correct
46 Correct 55 ms 22808 KB Output is correct
47 Correct 55 ms 23060 KB Output is correct
48 Correct 44 ms 8388 KB Output is correct
49 Correct 50 ms 8968 KB Output is correct
50 Correct 50 ms 8980 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 17 ms 4824 KB Output is correct
53 Correct 54 ms 9084 KB Output is correct
54 Correct 55 ms 9164 KB Output is correct
55 Correct 53 ms 10064 KB Output is correct
56 Correct 55 ms 10408 KB Output is correct
57 Correct 46 ms 8688 KB Output is correct
58 Correct 57 ms 9164 KB Output is correct
59 Correct 21 ms 4760 KB Output is correct
60 Correct 52 ms 8532 KB Output is correct
61 Correct 61 ms 9092 KB Output is correct
62 Correct 73 ms 9164 KB Output is correct
63 Correct 65 ms 9216 KB Output is correct
64 Correct 58 ms 9288 KB Output is correct
65 Correct 43 ms 9548 KB Output is correct
66 Correct 45 ms 9640 KB Output is correct
67 Correct 35 ms 10280 KB Output is correct
68 Correct 36 ms 10180 KB Output is correct
69 Correct 36 ms 10264 KB Output is correct
70 Correct 36 ms 10184 KB Output is correct