oj.uz

답안 #102124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102124 2019-03-22T16:36:42 Z tpoppo Lamps (JOI19_lamps) C++14
4 / 100
 66 ms 28096 KB 
#include <bits/stdc++.h>

using namespace std;
const int MAXN = 1e6 + 100;
int n;
string a,b;

int dp[MAXN][2][3];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cin >> n;
	cin >> a >> b;
	memset(dp,0x66,sizeof(dp));
	
	
	for(int inv=0;inv<2;inv++) {
		for(int z=0;z<3;z++) {
			dp[0][inv][z] = (inv == 1) + (z != 2);
		}
	}
	
	for(int i=0;i<=n;i++) {
		for(int inv=0;inv<2;inv++) {
			for(int z=0;z<3;z++) {

				//cout<<setw(10)<<dp[i][inv][z]<<" ";
				if(b[i] == '0') dp[i+1][inv][0] = min(dp[i+1][inv][0],dp[i][inv][z] + (z != 0) );
				if(b[i] == '0') dp[i+1][inv][0] = min(dp[i+1][inv][0],dp[i][!inv][z] + 1 + (z != 0) );

				if(b[i] == '1') dp[i+1][inv][1] = min(dp[i+1][inv][1],dp[i][inv][z] + (z != 1) );
				if(b[i] == '1') dp[i+1][!inv][1] = min(dp[i+1][!inv][1],dp[i][inv][z] + 1 + (z != 1) );


				if(b[i] == a[i]) dp[i+1][0][2] = min(dp[i+1][0][2],dp[i][inv][z]  );
				else dp[i+1][1][2] = min(dp[i+1][1][2],dp[i][inv][z] + (inv != 1) );
			}
		}//cout<<endl;
	}
	int rs = 1e9;
	for(int inv=0;inv<2;inv++) {
		for(int z=0;z<3;z++) {
			rs = min(rs,dp[n][inv][z]);
		}
	}

	cout<<rs<<'\n';

	return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23804 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 63 ms 23928 KB Output is correct
4 Correct 22 ms 23800 KB Output is correct
5 Correct 26 ms 23792 KB Output is correct
6 Correct 25 ms 23808 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 25 ms 23944 KB Output is correct
9 Correct 21 ms 23784 KB Output is correct
10 Correct 21 ms 23800 KB Output is correct
11 Correct 20 ms 23808 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 24 ms 23808 KB Output is correct
15 Correct 22 ms 23768 KB Output is correct
16 Incorrect 23 ms 23808 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23804 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 63 ms 23928 KB Output is correct
4 Correct 22 ms 23800 KB Output is correct
5 Correct 26 ms 23792 KB Output is correct
6 Correct 25 ms 23808 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 25 ms 23944 KB Output is correct
9 Correct 21 ms 23784 KB Output is correct
10 Correct 21 ms 23800 KB Output is correct
11 Correct 20 ms 23808 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 24 ms 23808 KB Output is correct
15 Correct 22 ms 23768 KB Output is correct
16 Incorrect 23 ms 23808 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 23884 KB Output is correct
2 Correct 21 ms 23800 KB Output is correct
3 Correct 24 ms 23796 KB Output is correct
4 Correct 23 ms 23808 KB Output is correct
5 Correct 23 ms 23808 KB Output is correct
6 Correct 22 ms 23800 KB Output is correct
7 Correct 54 ms 27972 KB Output is correct
8 Correct 66 ms 27860 KB Output is correct
9 Correct 58 ms 28096 KB Output is correct
10 Correct 61 ms 27980 KB Output is correct
11 Correct 60 ms 27984 KB Output is correct
12 Correct 58 ms 27852 KB Output is correct
13 Correct 58 ms 27860 KB Output is correct
14 Correct 58 ms 27848 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 23804 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 63 ms 23928 KB Output is correct
4 Correct 22 ms 23800 KB Output is correct
5 Correct 26 ms 23792 KB Output is correct
6 Correct 25 ms 23808 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 25 ms 23944 KB Output is correct
9 Correct 21 ms 23784 KB Output is correct
10 Correct 21 ms 23800 KB Output is correct
11 Correct 20 ms 23808 KB Output is correct
12 Correct 20 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 24 ms 23808 KB Output is correct
15 Correct 22 ms 23768 KB Output is correct
16 Incorrect 23 ms 23808 KB Output isn't correct
17 Halted 0 ms 0 KB -