oj.uz

답안 #481893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481893 2021-10-22T07:28:06 Z radal The Xana coup (BOI21_xanadu) C++14
100 / 100
 86 ms 22796 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC target("avx2,fma")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pll;
const int N = 3e5+20,mod = 1e9+7,inf = 2e9,sq = 400;
int poww(int n,ll k){
    if (!k) return 1;
    if (k == 1) return n;
    int r = poww(n,k/2);
    return 1ll*r*r%mod*poww(n,k&1)%mod;
}
inline int mkay(int x,int y){
    if (x+y < mod) return x+y;
    return x+y-mod;
}
ll dp[N][2][2],dp2[N][2][2];
bool on[N];
vector<int> adj[N];
void dfs(int v,int p){
    int sz = adj[v].size();
    rep(i,0,sz){
        int u = adj[v][i];
        if (u != p){
            dfs(u,v);
        }
    }
    rep(i,0,sz){
        int u = adj[v][i];
        if (u != p){
            if (!i){
                rep(j,0,2) rep(k,0,2) dp2[i][j][k] = dp[u][j][k];
                continue;
            }
            
            dp2[i][0][0] = min(dp2[i-1][0][0]+dp[u][0][0],dp2[i-1][1][0]+dp[u][1][0]);
            dp2[i][0][1] = min(dp2[i-1][0][1]+dp[u][0][1],dp2[i-1][1][1]+dp[u][1][1]);
            dp2[i][1][0] = min(dp2[i-1][0][0]+dp[u][1][0],dp2[i-1][1][0]+dp[u][0][0]);
            dp2[i][1][1] = min(dp2[i-1][0][1]+dp[u][1][1],dp2[i-1][1][1]+dp[u][0][1]);
        }
        else{
            if (i){
                rep(j,0,2) rep(k,0,2) dp2[i][j][k] = dp2[i-1][j][k];
                continue;
            }
            rep(j,0,2) rep(k,0,2) dp2[i][j][k] = inf;
            dp2[i][0][1] = 0;
            dp2[i][0][0] = 0;
        }
    }
    if (on[v]){
        dp[v][0][0] = dp2[sz-1][1][0];
        dp[v][0][1] = dp2[sz-1][0][0];
        dp[v][1][0] = dp2[sz-1][0][1]+1;
        dp[v][1][1] = dp2[sz-1][1][1]+1;
    }
    else{
        dp[v][0][0] = dp2[sz-1][0][0];
        dp[v][0][1] = dp2[sz-1][1][0];
        dp[v][1][0] = dp2[sz-1][1][1]+1;
        dp[v][1][1] = dp2[sz-1][0][1]+1;
    }
}
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    rep(i,0,n-1){
        int u,v;
        cin >> u >> v;
        adj[v].pb(u);
        adj[u].pb(v);
    }
    rep(i,1,n+1) cin >> on[i];
    dfs(1,-1);
    ll ans;
    ans = min(dp[1][0][0],dp[1][1][0]);
    if (ans >= inf){
        cout << "impossible";
        return 0;
    }
    cout << ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 5 ms 7364 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 5 ms 7364 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 5 ms 7364 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 6 ms 7372 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 5 ms 7368 KB Output is correct
15 Correct 5 ms 7292 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 22728 KB Output is correct
2 Correct 60 ms 22596 KB Output is correct
3 Correct 52 ms 22796 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 22736 KB Output is correct
2 Correct 58 ms 22596 KB Output is correct
3 Correct 65 ms 22772 KB Output is correct
4 Correct 59 ms 14148 KB Output is correct
5 Correct 65 ms 14916 KB Output is correct
6 Correct 72 ms 15044 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 19 ms 9948 KB Output is correct
9 Correct 79 ms 14932 KB Output is correct
10 Correct 86 ms 15044 KB Output is correct
11 Correct 69 ms 15612 KB Output is correct
12 Correct 59 ms 15684 KB Output is correct
13 Correct 50 ms 14580 KB Output is correct
14 Correct 61 ms 15044 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 7372 KB Output is correct
2 Correct 5 ms 7372 KB Output is correct
3 Correct 5 ms 7372 KB Output is correct
4 Correct 6 ms 7372 KB Output is correct
5 Correct 5 ms 7364 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 5 ms 7372 KB Output is correct
8 Correct 5 ms 7372 KB Output is correct
9 Correct 5 ms 7372 KB Output is correct
10 Correct 5 ms 7364 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 6 ms 7372 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 5 ms 7368 KB Output is correct
15 Correct 5 ms 7292 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct
17 Correct 58 ms 22728 KB Output is correct
18 Correct 60 ms 22596 KB Output is correct
19 Correct 52 ms 22796 KB Output is correct
20 Correct 52 ms 22736 KB Output is correct
21 Correct 58 ms 22596 KB Output is correct
22 Correct 65 ms 22772 KB Output is correct
23 Correct 59 ms 14148 KB Output is correct
24 Correct 65 ms 14916 KB Output is correct
25 Correct 72 ms 15044 KB Output is correct
26 Correct 5 ms 7372 KB Output is correct
27 Correct 19 ms 9948 KB Output is correct
28 Correct 79 ms 14932 KB Output is correct
29 Correct 86 ms 15044 KB Output is correct
30 Correct 69 ms 15612 KB Output is correct
31 Correct 59 ms 15684 KB Output is correct
32 Correct 50 ms 14580 KB Output is correct
33 Correct 61 ms 15044 KB Output is correct
34 Correct 4 ms 7372 KB Output is correct
35 Correct 4 ms 7368 KB Output is correct
36 Correct 4 ms 7368 KB Output is correct
37 Correct 4 ms 7372 KB Output is correct
38 Correct 5 ms 7372 KB Output is correct
39 Correct 5 ms 7372 KB Output is correct
40 Correct 4 ms 7372 KB Output is correct
41 Correct 5 ms 7372 KB Output is correct
42 Correct 5 ms 7372 KB Output is correct
43 Correct 4 ms 7372 KB Output is correct
44 Correct 4 ms 7372 KB Output is correct
45 Correct 60 ms 22780 KB Output is correct
46 Correct 59 ms 22516 KB Output is correct
47 Correct 50 ms 22792 KB Output is correct
48 Correct 58 ms 14200 KB Output is correct
49 Correct 63 ms 14912 KB Output is correct
50 Correct 63 ms 15056 KB Output is correct
51 Correct 6 ms 7372 KB Output is correct
52 Correct 21 ms 9932 KB Output is correct
53 Correct 71 ms 14948 KB Output is correct
54 Correct 60 ms 15044 KB Output is correct
55 Correct 55 ms 15428 KB Output is correct
56 Correct 71 ms 15716 KB Output is correct
57 Correct 61 ms 14532 KB Output is correct
58 Correct 60 ms 15052 KB Output is correct
59 Correct 20 ms 9944 KB Output is correct
60 Correct 47 ms 14288 KB Output is correct
61 Correct 52 ms 14916 KB Output is correct
62 Correct 63 ms 15132 KB Output is correct
63 Correct 55 ms 15156 KB Output is correct
64 Correct 68 ms 15068 KB Output is correct
65 Correct 49 ms 15576 KB Output is correct
66 Correct 52 ms 15724 KB Output is correct
67 Correct 48 ms 18556 KB Output is correct
68 Correct 42 ms 18492 KB Output is correct
69 Correct 52 ms 18620 KB Output is correct
70 Correct 47 ms 18492 KB Output is correct