oj.uz

Submission #104616

# Submission time Handle Problem Language Result Execution time Memory
104616 2019-04-08T11:51:52 Z antimirage Lamps (JOI19_lamps) C++14
6 / 100
 1000 ms 18160 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int n, dp[N][2], pref[N][2];

string a, b;

inline int calc (int l, int r, int type){

      if (type == 0)
            return pref[r][0] - pref[l - 1][0] + (b[l - 1] == b[l] && b[l] == '0');

      return pref[r][1] - pref[l - 1][1] + (b[l - 1] == b[l] && b[l] == '1');
}
main(){

      memset( dp, 0x3f3f3f3f, sizeof(dp) );

      cin >> n >> a >> b;

      a = ' ' + a;
      b = ' ' + b;

      for (int i = 1; i <= n; i++){

            if (b[i] != b[i - 1])
                  pref[i][ b[i] - 48 ] = 1;

            pref[i][0] += pref[i - 1][0];
            pref[i][1] += pref[i - 1][1];
      }
      dp[0][0] = 0;

      for (int i = 1; i <= n; i++){

            if (a[i] == b[i])
                  dp[i][0] = min( dp[i - 1][1], dp[i - 1][0] );

            if (a[i] != b[i])
                  dp[i][1] = min( dp[i - 1][1], dp[i - 1][0] + 1);

            for (int j = i; j >= 1; j--){
                  dp[i][0] = min( dp[i][0], dp[j - 1][0] + calc( j, i, 1 ) + 1 );
                  dp[i][0] = min( dp[i][0], dp[j - 1][0] + calc( j, i, 0 ) + 1 );

                  dp[i][1] = min( dp[i][1], dp[j - 1][1] + calc( j, i, 0 ) + 1 );

                  dp[i][1] = min( dp[i][1], dp[j - 1][0] + calc( j, i, 0 ) - (b[i] == '0') + 2 );

                  dp[i][1] = min( dp[i][1], dp[j - 1][1] + calc( j, i, 1 ) + 1 );

                  dp[i][1] = min( dp[i][1], dp[j - 1][0] + calc( j, i, 1 ) -  (b[i] == '1') + 2 );
            }
      }
      cout << min(dp[n][0], dp[n][1]) << endl;
}
/**
13
0001101001101
0101100011011

0001101001101
0101101001101
0101100000101
0101100011011
**/

Compilation message

lamp.cpp:18:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
6.0 / 6.0

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

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8188 KB Output is correct
5 Correct 9 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 8 ms 8192 KB Output is correct
9 Correct 9 ms 8192 KB Output is correct
10 Correct 9 ms 8192 KB Output is correct
11 Correct 8 ms 8164 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 10 ms 8284 KB Output is correct
20 Correct 8 ms 8192 KB Output is correct
21 Correct 10 ms 8192 KB Output is correct
22 Correct 9 ms 8192 KB Output is correct
23 Correct 11 ms 8164 KB Output is correct
24 Correct 10 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 10 ms 8192 KB Output is correct
27 Correct 9 ms 8164 KB Output is correct
28 Correct 8 ms 8192 KB Output is correct
29 Correct 11 ms 8192 KB Output is correct
30 Correct 10 ms 8192 KB Output is correct
31 Correct 11 ms 8192 KB Output is correct
32 Correct 10 ms 8192 KB Output is correct
33 Correct 10 ms 8192 KB Output is correct
34 Correct 9 ms 8192 KB Output is correct
35 Correct 35 ms 8192 KB Output is correct
36 Correct 32 ms 8192 KB Output is correct
37 Correct 33 ms 8192 KB Output is correct
38 Correct 46 ms 8192 KB Output is correct
39 Correct 43 ms 8192 KB Output is correct
40 Incorrect 31 ms 8164 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 10 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Execution timed out 1076 ms 18160 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 9 ms 8188 KB Output is correct
5 Correct 9 ms 8192 KB Output is correct
6 Correct 9 ms 8192 KB Output is correct
7 Correct 9 ms 8192 KB Output is correct
8 Correct 8 ms 8192 KB Output is correct
9 Correct 9 ms 8192 KB Output is correct
10 Correct 9 ms 8192 KB Output is correct
11 Correct 8 ms 8164 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 9 ms 8192 KB Output is correct
15 Correct 9 ms 8192 KB Output is correct
16 Correct 9 ms 8192 KB Output is correct
17 Correct 9 ms 8192 KB Output is correct
18 Correct 9 ms 8192 KB Output is correct
19 Correct 10 ms 8284 KB Output is correct
20 Correct 8 ms 8192 KB Output is correct
21 Correct 10 ms 8192 KB Output is correct
22 Correct 9 ms 8192 KB Output is correct
23 Correct 11 ms 8164 KB Output is correct
24 Correct 10 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 10 ms 8192 KB Output is correct
27 Correct 9 ms 8164 KB Output is correct
28 Correct 8 ms 8192 KB Output is correct
29 Correct 11 ms 8192 KB Output is correct
30 Correct 10 ms 8192 KB Output is correct
31 Correct 11 ms 8192 KB Output is correct
32 Correct 10 ms 8192 KB Output is correct
33 Correct 10 ms 8192 KB Output is correct
34 Correct 9 ms 8192 KB Output is correct
35 Correct 35 ms 8192 KB Output is correct
36 Correct 32 ms 8192 KB Output is correct
37 Correct 33 ms 8192 KB Output is correct
38 Correct 46 ms 8192 KB Output is correct
39 Correct 43 ms 8192 KB Output is correct
40 Incorrect 31 ms 8164 KB Output isn't correct
41 Halted 0 ms 0 KB -