oj.uz

Submission #878909

# Submission time Handle Problem Language Result Execution time Memory
878909 2023-11-25T13:24:17 Z Mr_Ph The Xana coup (BOI21_xanadu) C++17
100 / 100
 91 ms 37796 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
ll mod=(ll)1e9+7;
ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
int dp[200002][2][2];
int n;
vi arr;
vector<vi>adj;
int dfs(int node,int parent,int tg,int cur)
{
    int pog=arr[node]^tg^cur;
   // cout<<node<<" "<<parent<<" "<<pog<<endl;
    if(dp[node][tg][cur]!=-1)return dp[node][tg][cur];
    if(parent&&adj[node].sz==1)return (pog?1e9:cur);
    //odds and even thingies depending on pog, (i forgor)
    int x=adj[node].sz;
    int newdp[x+2][2];
    memset(newdp,1e9,sizeof newdp);
    for(int i=0;i<=x+1;i++)newdp[i][0]=newdp[i][1]=1e9;
    newdp[0][pog]=cur;
    int cnt=0;
    vector<pair<int,int>>xd;
    xd.push_back({0,0});
    for(auto i:adj[node])
    {
        if(i==parent)continue;
        cnt++;
        int e=dfs(i,node,cur,1),e1=dfs(i,node,cur,0);
        for(int j=0;j<2;j++)
            newdp[cnt][j]=min(newdp[cnt-1][j^1]+e,newdp[cnt-1][j]+e1);
    }
   /* cout<<node<<" "<<parent<<" "<<pog<<" "<<tg<<" "<<cur<<" "<<newdp[xd.sz][0]<<endl;
    for(int i=0;i<xd.sz;i++)
    {
        cout<<newdp[i][0]<<" "<<newdp[i][1]<<endl;
    }
    for(auto i:xd)cout<<i.first<<" "<<i.second<<endl;
    cout<<"---"<<endl;
    */
    return dp[node][tg][cur]=newdp[cnt][0];
}
void preprocess() {}
void solve()
{
    cin>>n;
    adj.resize(n+1);
    arr.resize(n+1);
    for(int i=0;i<n-1;i++)
    {
        int a,b;
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    memset(dp,-1,sizeof dp);
    for(int i=1;i<=n;i++)cin>>arr[i];
    int x=min(dfs(1,0,0,1),dfs(1,0,0,0));
    if(x>=1e9)cout<<"impossible"<<endl;
    else cout<<x<<endl;
}
signed main()
{
    // freopen("meta_game_input.txt","r",stdin);
    // freopen("otput.txt","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 37576 KB Output is correct
2 Correct 71 ms 37264 KB Output is correct
3 Correct 64 ms 37736 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 37576 KB Output is correct
2 Correct 58 ms 37116 KB Output is correct
3 Correct 69 ms 37796 KB Output is correct
4 Correct 40 ms 14212 KB Output is correct
5 Correct 44 ms 14928 KB Output is correct
6 Correct 64 ms 15212 KB Output is correct
7 Correct 2 ms 6744 KB Output is correct
8 Correct 16 ms 9440 KB Output is correct
9 Correct 46 ms 14728 KB Output is correct
10 Correct 52 ms 14940 KB Output is correct
11 Correct 51 ms 16464 KB Output is correct
12 Correct 74 ms 16744 KB Output is correct
13 Correct 41 ms 14932 KB Output is correct
14 Correct 44 ms 15436 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 3 ms 6488 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6608 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6556 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6488 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 91 ms 37576 KB Output is correct
18 Correct 71 ms 37264 KB Output is correct
19 Correct 64 ms 37736 KB Output is correct
20 Correct 66 ms 37576 KB Output is correct
21 Correct 58 ms 37116 KB Output is correct
22 Correct 69 ms 37796 KB Output is correct
23 Correct 40 ms 14212 KB Output is correct
24 Correct 44 ms 14928 KB Output is correct
25 Correct 64 ms 15212 KB Output is correct
26 Correct 2 ms 6744 KB Output is correct
27 Correct 16 ms 9440 KB Output is correct
28 Correct 46 ms 14728 KB Output is correct
29 Correct 52 ms 14940 KB Output is correct
30 Correct 51 ms 16464 KB Output is correct
31 Correct 74 ms 16744 KB Output is correct
32 Correct 41 ms 14932 KB Output is correct
33 Correct 44 ms 15436 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 2 ms 6488 KB Output is correct
38 Correct 2 ms 6492 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6612 KB Output is correct
42 Correct 2 ms 6616 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 61 ms 37456 KB Output is correct
46 Correct 68 ms 37016 KB Output is correct
47 Correct 59 ms 37656 KB Output is correct
48 Correct 42 ms 14168 KB Output is correct
49 Correct 63 ms 14876 KB Output is correct
50 Correct 46 ms 15212 KB Output is correct
51 Correct 2 ms 6748 KB Output is correct
52 Correct 16 ms 9592 KB Output is correct
53 Correct 46 ms 14804 KB Output is correct
54 Correct 48 ms 14932 KB Output is correct
55 Correct 56 ms 16468 KB Output is correct
56 Correct 49 ms 16976 KB Output is correct
57 Correct 48 ms 14952 KB Output is correct
58 Correct 43 ms 15452 KB Output is correct
59 Correct 16 ms 9304 KB Output is correct
60 Correct 42 ms 13908 KB Output is correct
61 Correct 44 ms 14684 KB Output is correct
62 Correct 59 ms 15196 KB Output is correct
63 Correct 47 ms 14976 KB Output is correct
64 Correct 49 ms 14932 KB Output is correct
65 Correct 38 ms 15176 KB Output is correct
66 Correct 38 ms 15192 KB Output is correct
67 Correct 38 ms 16592 KB Output is correct
68 Correct 35 ms 16584 KB Output is correct
69 Correct 36 ms 16592 KB Output is correct
70 Correct 36 ms 16476 KB Output is correct