oj.uz

Submission #882910

# Submission time Handle Problem Language Result Execution time Memory
882910 2023-12-04T06:27:14 Z noyancanturk The Xana coup (BOI21_xanadu) C++17
100 / 100
 102 ms 26520 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=1e5+100;
#else
    const int lim=1e3;
#endif

#include "bits/stdc++.h"
using namespace std;

#define int long long
#define pb push_back

const int mod=1e9+7;
using pii=pair<int,int>;

bool types[lim];
vector<int>v[lim];
int dp[lim][2][2];
bool vis[lim][2][2];

void dfs(int node,int parent,bool clickpar,bool clicknode){
    if(vis[node][clickpar][clicknode])return;
    vis[node][clickpar][clicknode]=1;
    dp[node][clickpar][clicknode]=clicknode;
    bool cur=types[node]^clickpar^clicknode;
    vector<int>pos;
    for(int j:v[node]){
        if(j!=parent){
            dfs(j,node,clicknode,0),dfs(j,node,clicknode,1);
            dp[node][clickpar][clicknode]+=dp[j][clicknode][0];
            pos.pb(dp[j][clicknode][1]-dp[j][clicknode][0]);
        }
    }
    sort(pos.begin(),pos.end());
    int i=0;
    if(cur==1){
        if(!pos.size()){
            dp[node][clickpar][clicknode]=INT_MAX;
            return;
        }
        dp[node][clickpar][clicknode]+=pos[i++];
    }
    for(;i+1<pos.size();i+=2){
        if(pos[i]+pos[i+1]<0){
            dp[node][clickpar][clicknode]+=pos[i]+pos[i+1];
        }else{
            break;
        }
    }
}

inline void solve(){
    int n;
    cin>>n;
    for(int i=0;i<n-1;i++){
        int x,y;
        cin>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
    }
    for(int i=1;i<=n;i++){
        cin>>types[i];
    }
    dfs(1,-1,0,0);
    dfs(1,-1,0,1);
    int ans=min(dp[1][0][0],dp[1][0][1]);
    if(n<ans)cout<<"impossible\n";
    else cout<<ans<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else
    //freopen("grass.in","r",stdin);
    //freopen("grass.out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Compilation message

xanadu.cpp: In function 'void dfs(long long int, long long int, bool, bool)':
xanadu.cpp:44:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(;i+1<pos.size();i+=2){
      |          ~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5976 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5980 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5976 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5980 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6008 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 2 ms 6156 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5940 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 25056 KB Output is correct
2 Correct 53 ms 26100 KB Output is correct
3 Correct 53 ms 26452 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 24916 KB Output is correct
2 Correct 56 ms 26192 KB Output is correct
3 Correct 63 ms 26520 KB Output is correct
4 Correct 60 ms 11092 KB Output is correct
5 Correct 55 ms 11664 KB Output is correct
6 Correct 54 ms 11776 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 16 ms 7904 KB Output is correct
9 Correct 50 ms 11492 KB Output is correct
10 Correct 51 ms 11568 KB Output is correct
11 Correct 48 ms 12372 KB Output is correct
12 Correct 56 ms 12628 KB Output is correct
13 Correct 47 ms 11504 KB Output is correct
14 Correct 49 ms 11880 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5976 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5980 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6008 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 2 ms 6156 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5940 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 54 ms 25056 KB Output is correct
18 Correct 53 ms 26100 KB Output is correct
19 Correct 53 ms 26452 KB Output is correct
20 Correct 54 ms 24916 KB Output is correct
21 Correct 56 ms 26192 KB Output is correct
22 Correct 63 ms 26520 KB Output is correct
23 Correct 60 ms 11092 KB Output is correct
24 Correct 55 ms 11664 KB Output is correct
25 Correct 54 ms 11776 KB Output is correct
26 Correct 2 ms 5980 KB Output is correct
27 Correct 16 ms 7904 KB Output is correct
28 Correct 50 ms 11492 KB Output is correct
29 Correct 51 ms 11568 KB Output is correct
30 Correct 48 ms 12372 KB Output is correct
31 Correct 56 ms 12628 KB Output is correct
32 Correct 47 ms 11504 KB Output is correct
33 Correct 49 ms 11880 KB Output is correct
34 Correct 2 ms 5980 KB Output is correct
35 Correct 2 ms 5980 KB Output is correct
36 Correct 2 ms 5976 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 2 ms 5980 KB Output is correct
39 Correct 2 ms 5980 KB Output is correct
40 Correct 2 ms 6488 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5980 KB Output is correct
43 Correct 2 ms 5980 KB Output is correct
44 Correct 2 ms 5980 KB Output is correct
45 Correct 60 ms 26196 KB Output is correct
46 Correct 67 ms 26088 KB Output is correct
47 Correct 60 ms 26412 KB Output is correct
48 Correct 57 ms 11220 KB Output is correct
49 Correct 54 ms 11604 KB Output is correct
50 Correct 49 ms 11604 KB Output is correct
51 Correct 2 ms 5976 KB Output is correct
52 Correct 17 ms 8024 KB Output is correct
53 Correct 74 ms 11344 KB Output is correct
54 Correct 64 ms 11588 KB Output is correct
55 Correct 55 ms 12368 KB Output is correct
56 Correct 64 ms 12632 KB Output is correct
57 Correct 56 ms 11632 KB Output is correct
58 Correct 102 ms 12068 KB Output is correct
59 Correct 18 ms 7772 KB Output is correct
60 Correct 55 ms 11088 KB Output is correct
61 Correct 79 ms 11412 KB Output is correct
62 Correct 74 ms 11296 KB Output is correct
63 Correct 81 ms 11524 KB Output is correct
64 Correct 73 ms 11700 KB Output is correct
65 Correct 62 ms 11856 KB Output is correct
66 Correct 58 ms 11944 KB Output is correct
67 Correct 48 ms 13484 KB Output is correct
68 Correct 53 ms 13464 KB Output is correct
69 Correct 53 ms 13516 KB Output is correct
70 Correct 54 ms 13472 KB Output is correct