oj.uz

Submission #253141

# Submission time Handle Problem Language Result Execution time Memory
253141 2020-07-27T01:50:51 Z Dilshod_Imomov Lamps (JOI19_lamps) C++17
100 / 100
 185 ms 41804 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
// # pragma GCC optimize "-O3"
// # define int long long
  
using namespace std;
  
const int N = 1e6 + 7;
const int mod = 1e9 + 7;

vector < vector < int > > vc = { {}, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 1}, {2, 3}, {3, 1}, {3, 2}};
								//{1, 2, 3}, { 1, 3, 2 }, {2, 1, 3}, {2, 3, 1}, {3, 1, 2}, {3, 2, 1} }; 
// map < int, map < vector < int >, int > > dp;
int n, cnt[20][20], dp[N][10], change[2][10];
string a, b;

int get( int i, int x ) {
	if ( (int)vc[x].size() == 0 ) {
		int mn = N;
		for ( int j = 0; j < 10; j++ ) {
			mn = min( mn, dp[i - 1][j] );
		}
		return mn + (a[i] != b[i]);
	}
	int mn = N;
	for ( int y = 0; y < 10; y++ ) {
		int vsz = vc[x].size(), usz = vc[y].size();
		if ( vsz <= usz ) {
			mn = min( mn, dp[i - 1][y] + vsz - cnt[x][y] );
		}
		else {
			mn = min( mn, dp[i - 1][y] + vsz - cnt[y][x] );
		}
	}
	return mn;
}

int32_t main() {
    speed;
    cin >> n;
    cin >> a >> b;
    for ( int i = 0; i < 10; i++ ) {
    	for ( int j = 0; j < 10; j++ ) {
    		int vsz = vc[i].size(), mx = 0; 
			for ( int mask = 0; mask < (1 << vsz); mask++ ) {
				vector < int > x;
				int cnt = 0;
				for ( int bit = 0; bit < 3; bit++ ) {
					if ( (mask >> bit) & 1 ) {
						x.push_back( vc[i][bit] );
						cnt++;
					}
				}
				int ok = 0;
				if ( cnt ) {
					int ind = 0;
					for ( auto z: vc[j] ) {
						if ( ind < cnt && z == x[ind] ) {
							ind++;
						}
					}
					if ( ind == cnt ) {
						ok = 1;
					}
				}
				if ( ok ) {
					mx = max( mx, cnt );
				}
			}
			cnt[i][j] = mx;
    	}
    }
    for ( int i = 0; i < 10; i++ ) {
		char x = '0', y = '1';
		for ( auto j: vc[i] ) {
			if ( j == 1 ) {
				x = '0';
				y = '0';
			}
			else if ( j == 2 ) {
				x = '1';
				y = '1';
			}
			else {
				if ( y == '0' ) {
					y = '1';
				}
				else {
					y = '0';
				}
				if ( x == '0' ) {
					x = '1';
				}
				else {
					x = '0';
				}
			}
		}
    	change[0][i] = x - '0';
    	change[1][i] = y - '0';
    }
    for ( int j = 0; j < 10; j++ ) {
		if ( ('0' + change[a[0] - '0'][j]) != b[0] ) {
			dp[0][j] = N;
			continue;
		}
    	dp[0][j] = vc[j].size();
    }
    if ( a[0] != b[0] ) {
    	dp[0][0] = 1;
    }
    for ( int i = 1; i < n; i++ ) {
    	for ( int ind = 0; ind < 10; ind++ ) {
    		if ( ('0' + change[a[i] - '0'][ind]) != b[i] ) {
    			dp[i][ind] = N;
    			continue;
    		}
    		dp[i][ind] = get( i, ind );
    		/*for ( auto j: v ) {
    			cout << j << ' ';
    		}
    		cout << '\n';
    		cout << i << ' ' << dp[i][v] << '\n';
    		cout << "------------\n";*/
    	}
    }
    int mn = N;
    for ( int i = 0; i < 10; i++ ) {
    	mn = min( mn, dp[n - 1][i] );
    }
    cout << mn << '\n';
}
/*
8
11011100
01101001

13
1010010010100
0000111001011

18
001100010010000110
110110001000100101
*/

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 114 ms 41544 KB Output is correct
8 Correct 128 ms 41564 KB Output is correct
9 Correct 123 ms 41548 KB Output is correct
10 Correct 124 ms 41544 KB Output is correct
11 Correct 123 ms 41548 KB Output is correct
12 Correct 123 ms 41556 KB Output is correct
13 Correct 117 ms 41548 KB Output is correct
14 Correct 125 ms 41544 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 114 ms 41544 KB Output is correct
66 Correct 128 ms 41564 KB Output is correct
67 Correct 123 ms 41548 KB Output is correct
68 Correct 124 ms 41544 KB Output is correct
69 Correct 123 ms 41548 KB Output is correct
70 Correct 123 ms 41556 KB Output is correct
71 Correct 117 ms 41548 KB Output is correct
72 Correct 125 ms 41544 KB Output is correct
73 Correct 127 ms 41548 KB Output is correct
74 Correct 117 ms 41612 KB Output is correct
75 Correct 129 ms 41544 KB Output is correct
76 Correct 125 ms 41548 KB Output is correct
77 Correct 120 ms 41544 KB Output is correct
78 Correct 129 ms 41660 KB Output is correct
79 Correct 124 ms 41548 KB Output is correct
80 Correct 141 ms 41540 KB Output is correct
81 Correct 130 ms 41548 KB Output is correct
82 Correct 130 ms 41548 KB Output is correct
83 Correct 134 ms 41544 KB Output is correct
84 Correct 122 ms 41548 KB Output is correct
85 Correct 120 ms 41544 KB Output is correct
86 Correct 132 ms 41804 KB Output is correct
87 Correct 121 ms 41548 KB Output is correct
88 Correct 125 ms 41548 KB Output is correct
89 Correct 127 ms 41544 KB Output is correct
90 Correct 129 ms 41672 KB Output is correct
91 Correct 132 ms 41608 KB Output is correct
92 Correct 148 ms 41544 KB Output is correct
93 Correct 137 ms 41628 KB Output is correct
94 Correct 147 ms 41668 KB Output is correct
95 Correct 185 ms 41660 KB Output is correct
96 Correct 140 ms 41548 KB Output is correct
97 Correct 139 ms 41552 KB Output is correct
98 Correct 138 ms 41544 KB Output is correct
99 Correct 142 ms 41548 KB Output is correct
100 Correct 138 ms 41544 KB Output is correct
101 Correct 136 ms 41548 KB Output is correct
102 Correct 135 ms 41548 KB Output is correct