oj.uz

Submission #426171

# Submission time Handle Problem Language Result Execution time Memory
426171 2021-06-13T14:54:06 Z duality The Xana coup (BOI21_xanadu) C++11
100 / 100
 114 ms 15304 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

vi adjList[100000];
int c[100000];
int dp[100000][2][2],temp[2][2],temp2[2][2];
int doDFS(int u,int p) {
    int i;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) doDFS(v,u);
    }
    temp[0][c[u]] = 0,temp[1][c[u]^1] = 1;
    temp[0][c[u]^1] = temp[1][c[u]] = 1e9;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            temp2[0][0] = min(temp[0][0]+dp[v][0][0],temp[0][1]+dp[v][1][0]);
            temp2[0][1] = min(temp[0][1]+dp[v][0][0],temp[0][0]+dp[v][1][0]);
            temp2[1][0] = min(temp[1][0]+dp[v][0][1],temp[1][1]+dp[v][1][1]);
            temp2[1][1] = min(temp[1][1]+dp[v][0][1],temp[1][0]+dp[v][1][1]);
            temp[0][0] = min(temp2[0][0],(int) 1e9);
            temp[0][1] = min(temp2[0][1],(int) 1e9);
            temp[1][0] = min(temp2[1][0],(int) 1e9);
            temp[1][1] = min(temp2[1][1],(int) 1e9);
        }
    }
    dp[u][0][0] = temp[0][0];
    dp[u][0][1] = temp[0][1];
    dp[u][1][0] = temp[1][0];
    dp[u][1][1] = temp[1][1];
    return 0;
}
int main() {
    int i;
    int N,a,b;
    scanf("%d",&N);
    for (i = 0; i < N-1; i++) {
        scanf("%d %d",&a,&b);
        a--,b--;
        adjList[a].pb(b);
        adjList[b].pb(a);
    }
    for (i = 0; i < N; i++) scanf("%d",&c[i]);
    doDFS(0,-1);
    if (min(dp[0][0][0],dp[0][1][0]) >= 1e9) printf("impossible\n");
    else printf("%d\n",min(dp[0][0][0],dp[0][1][0]));

    return 0;
}

Compilation message

xanadu.cpp: In function 'int doDFS(int, int)':
xanadu.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (i = 0; i < adjList[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~~~~
xanadu.cpp:21:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for (i = 0; i < adjList[u].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~~~~
xanadu.cpp: In function 'int main()':
xanadu.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
xanadu.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         scanf("%d %d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~
xanadu.cpp:50:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |     for (i = 0; i < N; i++) scanf("%d",&c[i]);
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 2 ms 2656 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 3 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 15280 KB Output is correct
2 Correct 80 ms 15000 KB Output is correct
3 Correct 82 ms 15244 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 15180 KB Output is correct
2 Correct 103 ms 15108 KB Output is correct
3 Correct 77 ms 15304 KB Output is correct
4 Correct 68 ms 8440 KB Output is correct
5 Correct 114 ms 8952 KB Output is correct
6 Correct 114 ms 8944 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 22 ms 4812 KB Output is correct
9 Correct 71 ms 8920 KB Output is correct
10 Correct 75 ms 9028 KB Output is correct
11 Correct 101 ms 9416 KB Output is correct
12 Correct 109 ms 9588 KB Output is correct
13 Correct 78 ms 8664 KB Output is correct
14 Correct 80 ms 8952 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2648 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 3 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 2 ms 2656 KB Output is correct
10 Correct 3 ms 2652 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 3 ms 2652 KB Output is correct
15 Correct 3 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 86 ms 15280 KB Output is correct
18 Correct 80 ms 15000 KB Output is correct
19 Correct 82 ms 15244 KB Output is correct
20 Correct 85 ms 15180 KB Output is correct
21 Correct 103 ms 15108 KB Output is correct
22 Correct 77 ms 15304 KB Output is correct
23 Correct 68 ms 8440 KB Output is correct
24 Correct 114 ms 8952 KB Output is correct
25 Correct 114 ms 8944 KB Output is correct
26 Correct 2 ms 2636 KB Output is correct
27 Correct 22 ms 4812 KB Output is correct
28 Correct 71 ms 8920 KB Output is correct
29 Correct 75 ms 9028 KB Output is correct
30 Correct 101 ms 9416 KB Output is correct
31 Correct 109 ms 9588 KB Output is correct
32 Correct 78 ms 8664 KB Output is correct
33 Correct 80 ms 8952 KB Output is correct
34 Correct 2 ms 2636 KB Output is correct
35 Correct 2 ms 2636 KB Output is correct
36 Correct 2 ms 2636 KB Output is correct
37 Correct 2 ms 2648 KB Output is correct
38 Correct 3 ms 2636 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 3 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 3 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 2 ms 2636 KB Output is correct
45 Correct 78 ms 15172 KB Output is correct
46 Correct 70 ms 15072 KB Output is correct
47 Correct 71 ms 15284 KB Output is correct
48 Correct 96 ms 8304 KB Output is correct
49 Correct 89 ms 8932 KB Output is correct
50 Correct 77 ms 9020 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 21 ms 4740 KB Output is correct
53 Correct 78 ms 8972 KB Output is correct
54 Correct 79 ms 9112 KB Output is correct
55 Correct 107 ms 9388 KB Output is correct
56 Correct 95 ms 9572 KB Output is correct
57 Correct 77 ms 8600 KB Output is correct
58 Correct 86 ms 9032 KB Output is correct
59 Correct 22 ms 4684 KB Output is correct
60 Correct 67 ms 8428 KB Output is correct
61 Correct 68 ms 8972 KB Output is correct
62 Correct 76 ms 9140 KB Output is correct
63 Correct 75 ms 9136 KB Output is correct
64 Correct 102 ms 9152 KB Output is correct
65 Correct 65 ms 9564 KB Output is correct
66 Correct 62 ms 9564 KB Output is correct
67 Correct 56 ms 9372 KB Output is correct
68 Correct 60 ms 9356 KB Output is correct
69 Correct 59 ms 9368 KB Output is correct
70 Correct 59 ms 9404 KB Output is correct