oj.uz

Submission #534988

# Submission time Handle Problem Language Result Execution time Memory
534988 2022-03-09T08:23:51 Z 79brue Lamps (JOI19_lamps) C++14
100 / 100
 246 ms 27764 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n;
bool a[1000002];
bool b[1000002];
int DP[1000002][3][2]; /// 0 1 ? / 0101 1010

bool diff(int i, int x, int y){
    return b[i-1]==x && b[i]!=y;
}

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++) scanf("%1d", &a[i]);
    for(int i=1; i<=n; i++) scanf("%1d", &b[i]);

    for(int i=0; i<=n; i++) for(int j=0; j<3; j++) for(int k=0; k<2; k++) DP[i][j][k] = 1e9;
    DP[0][2][0] = 0;

    for(int i=1; i<=n; i++){
        for(int j=0; j<2; j++){
            for(int k=0; k<2; k++){
                DP[i][j][k] = min(DP[i][j][k], DP[i-1][j][k] + diff(i, j, j));
                DP[i][j][k] = min(DP[i][j][k], DP[i-1][!j][k] + diff(i, !j, j) + (j!=k));
                if(j==k) DP[i][j][k] = min(DP[i][j][k], DP[i-1][2][0] + diff(i, a[i-1], j) + 1);

                DP[i][2][0] = min(DP[i][2][0], DP[i-1][j][k] + diff(i, j, a[i]));
//                printf("%d %d %d: %d\n", i, j, k, DP[i][j][k]);
            }
        }
        DP[i][2][0] = min(DP[i][2][0], DP[i-1][2][0] + diff(i, a[i-1], a[i]));
//        printf("%d %d %d: %d\n", i, 2, 0, DP[i][2][0]);
    }

    int ans = 1e9;
    for(int i=0; i<3; i++) for(int j=0; j<2; j++) ans = min(ans, DP[n][i][j]);
    printf("%d", ans);
}

Compilation message

lamp.cpp: In function 'int main()':
lamp.cpp:18:38: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'bool*' [-Wformat=]
   18 |     for(int i=1; i<=n; i++) scanf("%1d", &a[i]);
      |                                    ~~^   ~~~~~
      |                                      |   |
      |                                      |   bool*
      |                                      int*
lamp.cpp:19:38: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'bool*' [-Wformat=]
   19 |     for(int i=1; i<=n; i++) scanf("%1d", &b[i]);
      |                                    ~~^   ~~~~~
      |                                      |   |
      |                                      |   bool*
      |                                      int*
lamp.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
lamp.cpp:18:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     for(int i=1; i<=n; i++) scanf("%1d", &a[i]);
      |                             ~~~~~^~~~~~~~~~~~~~
lamp.cpp:19:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     for(int i=1; i<=n; i++) scanf("%1d", &b[i]);
      |                             ~~~~~^~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 2 ms 308 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 296 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 2 ms 332 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 292 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 158 ms 27680 KB Output is correct
8 Correct 161 ms 27640 KB Output is correct
9 Correct 208 ms 27584 KB Output is correct
10 Correct 155 ms 27572 KB Output is correct
11 Correct 161 ms 27624 KB Output is correct
12 Correct 158 ms 27580 KB Output is correct
13 Correct 186 ms 27560 KB Output is correct
14 Correct 157 ms 27628 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 296 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 2 ms 308 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 296 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 2 ms 332 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 0 ms 292 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 158 ms 27680 KB Output is correct
66 Correct 161 ms 27640 KB Output is correct
67 Correct 208 ms 27584 KB Output is correct
68 Correct 155 ms 27572 KB Output is correct
69 Correct 161 ms 27624 KB Output is correct
70 Correct 158 ms 27580 KB Output is correct
71 Correct 186 ms 27560 KB Output is correct
72 Correct 157 ms 27628 KB Output is correct
73 Correct 160 ms 27612 KB Output is correct
74 Correct 177 ms 27564 KB Output is correct
75 Correct 182 ms 27676 KB Output is correct
76 Correct 192 ms 27572 KB Output is correct
77 Correct 173 ms 27648 KB Output is correct
78 Correct 177 ms 27676 KB Output is correct
79 Correct 246 ms 27672 KB Output is correct
80 Correct 179 ms 27644 KB Output is correct
81 Correct 175 ms 27588 KB Output is correct
82 Correct 166 ms 27668 KB Output is correct
83 Correct 184 ms 27572 KB Output is correct
84 Correct 190 ms 27688 KB Output is correct
85 Correct 172 ms 27604 KB Output is correct
86 Correct 245 ms 27660 KB Output is correct
87 Correct 175 ms 27580 KB Output is correct
88 Correct 230 ms 27716 KB Output is correct
89 Correct 162 ms 27588 KB Output is correct
90 Correct 159 ms 27628 KB Output is correct
91 Correct 194 ms 27568 KB Output is correct
92 Correct 172 ms 27588 KB Output is correct
93 Correct 186 ms 27612 KB Output is correct
94 Correct 232 ms 27620 KB Output is correct
95 Correct 169 ms 27664 KB Output is correct
96 Correct 221 ms 27664 KB Output is correct
97 Correct 176 ms 27764 KB Output is correct
98 Correct 164 ms 27576 KB Output is correct
99 Correct 177 ms 27640 KB Output is correct
100 Correct 194 ms 27560 KB Output is correct
101 Correct 170 ms 27588 KB Output is correct
102 Correct 170 ms 27564 KB Output is correct