oj.uz

Submission #430035

# Submission time Handle Problem Language Result Execution time Memory
430035 2021-06-16T11:05:11 Z lukameladze The Xana coup (BOI21_xanadu) C++14
100 / 100
 188 ms 24512 KB 
# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N=3e5+5;
long long dp1[5],dp[3][3][N],x,xx,xx1,c[N],n,a,b;
vector <long long> vv,v[N];
pair <long long, long long> pp;
pair <long long, long long> go(int col, int a, int p) {
     dp1[0]=0; dp1[1]=1e9;
     for (int i=0; i<v[a].size(); i++) {
          if (v[a][i]==p) continue;
          x=v[a][i]; xx=dp1[0]; xx1=dp1[1];
          dp1[0]=min(xx+dp[col][0][x], xx1+dp[col][1][x]);
          dp1[1]=min(xx1+dp[col][0][x], xx+dp[col][1][x]);
     }
     return {dp1[0], dp1[1]};
}
void dfs(int a, int p) {
     vv.clear();
     for (int i=0; i<v[a].size(); i++) {
          if (v[a][i]!=p) dfs(v[a][i],a);
     }
     for (int i=0; i<v[a].size(); i++) {
          if (v[a][i]!=p) vv.pb(v[a][i]);
     }
     //dp[0][0][a], dp[1][0][a]
     pp=go(0,a,p);
     if (c[a]==0)
     dp[0][0][a]=pp.f; else dp[0][0][a]=pp.s;
     if (c[a]==0) dp[1][0][a]=pp.s; else dp[1][0][a]=pp.f;
     // dp[0][1][a] dp[1][1][a]
     pp=go(1,a,p);
     //if (a==4 || a==5) cout<<a<<endl;
     //if (a==4) cout<<pp.f<<" "<<pp.s<<endl;
     if (c[a]==0) dp[0][1][a]=pp.s+1; else dp[0][1][a]=pp.f+1;
     if (c[a]==0) dp[1][1][a]=pp.f+1; else dp[1][1][a]=pp.s+1;
}
int main() {
     cin>>n;
     for (int i=1; i<=n-1; i++) {
          cin>>a>>b;
          v[a].pb(b); v[b].pb(a);
     }
     for (int i=1; i<=n; i++) {
          cin>>c[i];
     }
     dfs(1,0);
    // cout<<dp[0][1][5]<<endl;
    if (min(dp[0][1][1],dp[0][0][1])>=1e9) cout<<"impossible"<<endl;
    else
      cout<<min(dp[0][1][1],dp[0][0][1])<<endl;
}

Compilation message

xanadu.cpp: In function 'std::pair<long long int, long long int> go(int, int, int)':
xanadu.cpp:12:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |      for (int i=0; i<v[a].size(); i++) {
      |                    ~^~~~~~~~~~~~
xanadu.cpp: In function 'void dfs(int, int)':
xanadu.cpp:22:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |      for (int i=0; i<v[a].size(); i++) {
      |                    ~^~~~~~~~~~~~
xanadu.cpp:25:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |      for (int i=0; i<v[a].size(); i++) {
      |                    ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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 5 ms 7352 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory 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 5 ms 7352 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7372 KB Output is correct
7 Correct 5 ms 7312 KB Output is correct
8 Correct 5 ms 7332 KB Output is correct
9 Correct 5 ms 7348 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct
11 Correct 5 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 5 ms 7352 KB Output is correct
14 Correct 5 ms 7372 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 6 ms 7348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 24444 KB Output is correct
2 Correct 132 ms 24188 KB Output is correct
3 Correct 127 ms 24376 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 24372 KB Output is correct
2 Correct 126 ms 24120 KB Output is correct
3 Correct 163 ms 24392 KB Output is correct
4 Correct 121 ms 15548 KB Output is correct
5 Correct 132 ms 16392 KB Output is correct
6 Correct 146 ms 16592 KB Output is correct
7 Correct 5 ms 7356 KB Output is correct
8 Correct 43 ms 10244 KB Output is correct
9 Correct 165 ms 16260 KB Output is correct
10 Correct 153 ms 16324 KB Output is correct
11 Correct 157 ms 16540 KB Output is correct
12 Correct 188 ms 16812 KB Output is correct
13 Correct 133 ms 16316 KB Output is correct
14 Correct 147 ms 16892 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory 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 5 ms 7352 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7372 KB Output is correct
7 Correct 5 ms 7312 KB Output is correct
8 Correct 5 ms 7332 KB Output is correct
9 Correct 5 ms 7348 KB Output is correct
10 Correct 5 ms 7372 KB Output is correct
11 Correct 5 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 5 ms 7352 KB Output is correct
14 Correct 5 ms 7372 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 6 ms 7348 KB Output is correct
17 Correct 143 ms 24444 KB Output is correct
18 Correct 132 ms 24188 KB Output is correct
19 Correct 127 ms 24376 KB Output is correct
20 Correct 137 ms 24372 KB Output is correct
21 Correct 126 ms 24120 KB Output is correct
22 Correct 163 ms 24392 KB Output is correct
23 Correct 121 ms 15548 KB Output is correct
24 Correct 132 ms 16392 KB Output is correct
25 Correct 146 ms 16592 KB Output is correct
26 Correct 5 ms 7356 KB Output is correct
27 Correct 43 ms 10244 KB Output is correct
28 Correct 165 ms 16260 KB Output is correct
29 Correct 153 ms 16324 KB Output is correct
30 Correct 157 ms 16540 KB Output is correct
31 Correct 188 ms 16812 KB Output is correct
32 Correct 133 ms 16316 KB Output is correct
33 Correct 147 ms 16892 KB Output is correct
34 Correct 5 ms 7372 KB Output is correct
35 Correct 5 ms 7372 KB Output is correct
36 Correct 5 ms 7348 KB Output is correct
37 Correct 5 ms 7372 KB Output is correct
38 Correct 6 ms 7372 KB Output is correct
39 Correct 5 ms 7372 KB Output is correct
40 Correct 6 ms 7348 KB Output is correct
41 Correct 5 ms 7372 KB Output is correct
42 Correct 5 ms 7352 KB Output is correct
43 Correct 5 ms 7348 KB Output is correct
44 Correct 5 ms 7372 KB Output is correct
45 Correct 126 ms 24384 KB Output is correct
46 Correct 132 ms 24180 KB Output is correct
47 Correct 154 ms 24512 KB Output is correct
48 Correct 132 ms 15556 KB Output is correct
49 Correct 141 ms 16496 KB Output is correct
50 Correct 155 ms 16612 KB Output is correct
51 Correct 6 ms 7356 KB Output is correct
52 Correct 41 ms 10308 KB Output is correct
53 Correct 139 ms 16180 KB Output is correct
54 Correct 136 ms 16316 KB Output is correct
55 Correct 150 ms 16748 KB Output is correct
56 Correct 145 ms 16964 KB Output is correct
57 Correct 135 ms 16312 KB Output is correct
58 Correct 156 ms 16820 KB Output is correct
59 Correct 55 ms 10252 KB Output is correct
60 Correct 170 ms 15348 KB Output is correct
61 Correct 135 ms 16044 KB Output is correct
62 Correct 141 ms 16196 KB Output is correct
63 Correct 148 ms 16304 KB Output is correct
64 Correct 141 ms 16264 KB Output is correct
65 Correct 132 ms 16688 KB Output is correct
66 Correct 127 ms 16772 KB Output is correct
67 Correct 123 ms 17984 KB Output is correct
68 Correct 134 ms 18020 KB Output is correct
69 Correct 135 ms 17976 KB Output is correct
70 Correct 119 ms 17992 KB Output is correct