oj.uz

Submission #447248

# Submission time Handle Problem Language Result Execution time Memory
447248 2021-07-25T13:35:53 Z ak2006 The Xana coup (BOI21_xanadu) C++14
30 / 100
 112 ms 40136 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
    fast;
}
int n = 1e5 + 5;
vvi adj(n);
vvvl dp(n,vvl(2,vl(2,inf)));
vl vals(n);
void dfs(int u,int p)
{
    dp[u][vals[u]][0] = dp[u][vals[u]][1] = 0;
    for (int v:adj[u]){
        if (v == p)continue;
        dfs(v,u);
        vvl temp(4,vl(4));
        for (int f1 = 0;f1<2;f1++){
            for (int f2 = 0;f2<2;f2++){
                temp[f1][f2] = min(
                    dp[u][f1][f2] + dp[v][f2][0],
                    dp[u][!f1][f2] + dp[v][!f2][1] + 1
                    );
            }
        }
        for (int f1 = 0;f1<2;f1++)for (int f2 = 0;f2<2;f2++)dp[u][f1][f2] = temp[f1][f2];
    }
}
int main()
{
    setIO();
    cin>>n;
    for (int i = 1;i<=n - 1;i++){
        int u,v;
        cin>>u>>v;
        adj[u].pb(v),adj[v].pb(u);
    }
    for (int i = 1;i<=n;i++)cin>>vals[i];
    dfs(1,0);
    ll ans = min(dp[1][0][0],dp[1][1][1] + 1);
    if (ans > n)cout<<"impossible";
    else cout<<ans;
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18252 KB Output is correct
2 Correct 22 ms 18328 KB Output is correct
3 Correct 21 ms 18316 KB Output is correct
4 Correct 20 ms 18312 KB Output is correct
5 Correct 21 ms 18332 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18252 KB Output is correct
2 Correct 22 ms 18328 KB Output is correct
3 Correct 21 ms 18316 KB Output is correct
4 Correct 20 ms 18312 KB Output is correct
5 Correct 21 ms 18332 KB Output is correct
6 Correct 20 ms 18292 KB Output is correct
7 Correct 23 ms 18328 KB Output is correct
8 Correct 20 ms 18252 KB Output is correct
9 Correct 20 ms 18264 KB Output is correct
10 Correct 20 ms 18320 KB Output is correct
11 Correct 20 ms 18252 KB Output is correct
12 Correct 20 ms 18252 KB Output is correct
13 Correct 20 ms 18308 KB Output is correct
14 Correct 20 ms 18260 KB Output is correct
15 Correct 20 ms 18280 KB Output is correct
16 Correct 20 ms 18324 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 39876 KB Output is correct
2 Correct 104 ms 39632 KB Output is correct
3 Correct 106 ms 40136 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 39820 KB Output is correct
2 Correct 102 ms 39584 KB Output is correct
3 Correct 104 ms 39940 KB Output is correct
4 Incorrect 109 ms 22264 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 18252 KB Output is correct
2 Correct 22 ms 18328 KB Output is correct
3 Correct 21 ms 18316 KB Output is correct
4 Correct 20 ms 18312 KB Output is correct
5 Correct 21 ms 18332 KB Output is correct
6 Correct 20 ms 18292 KB Output is correct
7 Correct 23 ms 18328 KB Output is correct
8 Correct 20 ms 18252 KB Output is correct
9 Correct 20 ms 18264 KB Output is correct
10 Correct 20 ms 18320 KB Output is correct
11 Correct 20 ms 18252 KB Output is correct
12 Correct 20 ms 18252 KB Output is correct
13 Correct 20 ms 18308 KB Output is correct
14 Correct 20 ms 18260 KB Output is correct
15 Correct 20 ms 18280 KB Output is correct
16 Correct 20 ms 18324 KB Output is correct
17 Correct 112 ms 39876 KB Output is correct
18 Correct 104 ms 39632 KB Output is correct
19 Correct 106 ms 40136 KB Output is correct
20 Correct 100 ms 39820 KB Output is correct
21 Correct 102 ms 39584 KB Output is correct
22 Correct 104 ms 39940 KB Output is correct
23 Incorrect 109 ms 22264 KB Output isn't correct
24 Halted 0 ms 0 KB -