oj.uz

Submission #104990

# Submission time Handle Problem Language Result Execution time Memory
104990 2019-04-10T04:45:10 Z antimirage Lamps (JOI19_lamps) C++14
6 / 100
 1000 ms 31932 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');
}

struct st{
	int must, val;
};

st t[3][3][N * 4], t11[N * 4], t10[N * 4];

void push (int i, int j, int v, int tl, int tr)
{
	t[i][j][v].val += t[i][j][v].must;
	
	if (tl != tr){
		t[i][j][v + v].must += t[i][j][v].must;
		t[i][j][v + v + 1].must += t[i][j][v].must;
	}
	t[i][j][v].must = 0;
}

void update (int i, int j, int l, int r, int val, int v = 1, int tl = 0, int tr = n)
{
	push(i, j, v, tl, tr);
	if (l > tr || tl > r) return;
	
	if (l <= tl && tr <= r){
		t[i][j][v].must += val;
		push(i, j, v, tl, tr);
		return;
	}
	int tm = (tl + tr) >> 1;
	
	update(i, j, l, r, val, v + v, tl, tm);
	update(i, j, l, r, val, v + v + 1, tm + 1, tr);
	
	t[i][j][v].val = min( t[i][j][v + v].val, t[i][j][v + v + 1].val );
}
int get (int i, int j, int l, int r, int v = 1, int tl = 0, int tr = n)
{
	push(i, j, v, tl, tr);
	
	if (l > tr || tl > r)
		return 1e9 + 7;
		
	if (l <= tl && tr <= r)
		return t[i][j][v].val;
		
	int tm = (tl + tr) >> 1;
	
	return min( get(i, j, l, r, v + v, tl, tm), get(i, j, l, r, v + v + 1, tm + 1, tr) );
}

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;
	  update( 1, 0, 0, 0, dp[0][1] );
	  update( 1, 1, 0, 0, dp[0][1] );
 
		for (int i = 1; i <= n; i++){
		  
			if (b[i] != b[i - 1] && i - 2 >= 0){
				update(0, b[i] - 48, 0, i - 2, +1);
				update(1, b[i] - 48, 0, i - 2, +1);
			}
			update(0, b[i] - 48, i - 1, i - 1, +1);
			update(1, b[i] - 48, i - 1, i - 1, +1);

			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);
				  
				 
			dp[i][0] = min( dp[i][0], get(0, 1, 0, i - 1) + 1 );
			dp[i][0] = min( dp[i][0], get(0, 0, 0, i - 1) + 1 );
			
			dp[i][1] = min( dp[i][1], get(1, 0, 0, i - 1) + 1 );
			dp[i][1] = min( dp[i][1], get(1, 1, 0, i - 1) + 1 );
			
			dp[i][1] = min( dp[i][1], get(0, 0, 0, i - 1) - (b[i] == '0') + 2 );
			dp[i][1] = min( dp[i][1], get(0, 1, 0, i - 1) - (b[i] == '1') + 2 );

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

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

13
0001101001101
0101100011011

8
11011100
01101001
**/

Compilation message

lamp.cpp:68: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 7 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 9 ms 8320 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 8 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 11 ms 8192 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 8 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 8320 KB Output is correct
18 Correct 10 ms 8192 KB Output is correct
19 Correct 10 ms 8192 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 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 10 ms 8192 KB Output is correct
28 Correct 10 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct
31 Correct 13 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 9 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 7 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 9 ms 8320 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 8 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 11 ms 8192 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 8 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 8320 KB Output is correct
18 Correct 10 ms 8192 KB Output is correct
19 Correct 10 ms 8192 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 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 10 ms 8192 KB Output is correct
28 Correct 10 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct
31 Correct 13 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 9 ms 8192 KB Output is correct
34 Correct 9 ms 8192 KB Output is correct
35 Correct 20 ms 8320 KB Output is correct
36 Correct 18 ms 8320 KB Output is correct
37 Correct 16 ms 8320 KB Output is correct
38 Correct 15 ms 8368 KB Output is correct
39 Correct 16 ms 8320 KB Output is correct
40 Incorrect 14 ms 8320 KB Output isn't correct
41 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

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

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8192 KB Output is correct
2 Correct 10 ms 8192 KB Output is correct
3 Correct 10 ms 8192 KB Output is correct
4 Correct 9 ms 8192 KB Output is correct
5 Correct 9 ms 8320 KB Output is correct
6 Correct 8 ms 8192 KB Output is correct
7 Correct 10 ms 8192 KB Output is correct
8 Correct 10 ms 8192 KB Output is correct
9 Correct 8 ms 8192 KB Output is correct
10 Correct 8 ms 8192 KB Output is correct
11 Correct 11 ms 8192 KB Output is correct
12 Correct 9 ms 8192 KB Output is correct
13 Correct 9 ms 8192 KB Output is correct
14 Correct 8 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 8320 KB Output is correct
18 Correct 10 ms 8192 KB Output is correct
19 Correct 10 ms 8192 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 9 ms 8192 KB Output is correct
24 Correct 9 ms 8192 KB Output is correct
25 Correct 9 ms 8192 KB Output is correct
26 Correct 9 ms 8192 KB Output is correct
27 Correct 10 ms 8192 KB Output is correct
28 Correct 10 ms 8192 KB Output is correct
29 Correct 9 ms 8192 KB Output is correct
30 Correct 9 ms 8192 KB Output is correct
31 Correct 13 ms 8192 KB Output is correct
32 Correct 9 ms 8192 KB Output is correct
33 Correct 9 ms 8192 KB Output is correct
34 Correct 9 ms 8192 KB Output is correct
35 Correct 20 ms 8320 KB Output is correct
36 Correct 18 ms 8320 KB Output is correct
37 Correct 16 ms 8320 KB Output is correct
38 Correct 15 ms 8368 KB Output is correct
39 Correct 16 ms 8320 KB Output is correct
40 Incorrect 14 ms 8320 KB Output isn't correct
41 Halted 0 ms 0 KB -