oj.uz

Submission #251944

# Submission time Handle Problem Language Result Execution time Memory
251944 2020-07-23T08:19:02 Z phamhoanghiep Lamps (JOI19_lamps) C++14
4 / 100
 133 ms 25972 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+1;
int dp[4][maxn];
int a[maxn];
int b[maxn];
// 0: assign 0
// 1: assign 1
// 2: flip
// 3: vohok
signed main() {
	int n;
	string sa;
	string sb;
	cin>>n>>sa>>sb;
	sa="z"+sa;
	sb="z"+sb;
	for(int i=1 ; i<=n ; i++) {
		if(sa[i]=='1') a[i]=1;
		else a[i]=0;
		if(sb[i]=='1') b[i]=1;
		else b[i]=0;
	}
	dp[0][0]=dp[1][0]=dp[2][0]=dp[3][0]=0;
	for(int i=1 ; i<=n ; i++) {
		if(i==1) {
			if(a[i]==b[i]) {
				dp[a[i]][i]=1;
				dp[3][i]=0;
				dp[2][i]=maxn;
				dp[1-a[i]][i]=maxn;
			}
			else {
				dp[1-a[i]][i]=1;
				dp[2][i]=1;
				dp[3][i]=maxn;
				dp[a[i]][i]=maxn;
			}
		}
		else {
			if(a[i]==b[i]) {
				dp[3][i]=min({
							dp[3][i-1],
							dp[2][i-1],
							dp[a[i]][i-1],
							dp[1-a[i]][i-1]
							});
				dp[2][i]=maxn;
				dp[1-a[i]][i]=maxn;
				dp[a[i]][i]=min({
								dp[a[i]][i-1],
								dp[2][i-1]+1,
								dp[3][i-1]+1,
								dp[1-a[i]][i-1]+1
								});
			}
			else {
				dp[3][i]=maxn;
				dp[2][i]=min({
							dp[2][i-1],
							dp[1][i-1]+1,
							dp[0][i-1]+1,
							dp[3][i-1]+1
							});
				dp[a[i]][i]=maxn;
				dp[b[i]][i]=min({
							dp[b[i]][i-1],
							dp[1-b[i]][i-1]+1,
							dp[2][i-1]+1,
							dp[3][i-1]+1
							});	
			}
		}
		
	}
//	for(int i=0 ; i<=3 ; i++) {
//		for(int j=1 ; j<=n ; j++) {
//			if(dp[i][j]==maxn) cout<<"| ";
//			else cout<<dp[i][j]<<" ";
//		}
//		cout<<endl;
//	}
	int ans1=min({dp[0][n],dp[1][n],dp[2][n],dp[3][n]});
	for(int i=1 ; i<=n ; i++) {
		b[i]=1-b[i];
	}
	dp[0][0]=dp[1][0]=dp[2][0]=dp[3][0]=0;
	for(int i=1 ; i<=n ; i++) {
		if(i==1) {
			if(a[i]==b[i]) {
				dp[a[i]][i]=1;
				dp[3][i]=0;
				dp[2][i]=maxn;
				dp[1-a[i]][i]=maxn;
			}
			else {
				dp[1-a[i]][i]=1;
				dp[2][i]=1;
				dp[3][i]=maxn;
				dp[a[i]][i]=maxn;
			}
		}
		else {
			if(a[i]==b[i]) {
				dp[3][i]=min({
							dp[3][i-1],
							dp[2][i-1],
							dp[a[i]][i-1],
							dp[1-a[i]][i-1]
							});
				dp[2][i]=maxn;
				dp[1-a[i]][i]=maxn;
				dp[a[i]][i]=min({
								dp[a[i]][i-1],
								dp[2][i-1]+1,
								dp[3][i-1]+1,
								dp[1-a[i]][i-1]+1
								});
			}
			else {
				dp[3][i]=maxn;
				dp[2][i]=min({
							dp[2][i-1],
							dp[1][i-1]+1,
							dp[0][i-1]+1,
							dp[3][i-1]+1
							});
				dp[a[i]][i]=maxn;
				dp[b[i]][i]=min({
							dp[b[i]][i-1],
							dp[1-b[i]][i-1]+1,
							dp[2][i-1]+1,
							dp[3][i-1]+1
							});	
			}
		}	
	}
	int ans2=min({dp[0][n]+1,dp[1][n]+1,dp[2][n]+1,dp[3][n]+1});
	cout<<min(ans1,ans2);
}

Subtask #1
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 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 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 Incorrect 0 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
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 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 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 Incorrect 0 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -

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 1 ms 384 KB Output is correct
4 Correct 1 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 128 ms 25972 KB Output is correct
8 Correct 131 ms 25776 KB Output is correct
9 Correct 130 ms 25792 KB Output is correct
10 Correct 128 ms 25812 KB Output is correct
11 Correct 133 ms 25792 KB Output is correct
12 Correct 131 ms 25792 KB Output is correct
13 Correct 132 ms 25792 KB Output is correct
14 Correct 133 ms 25780 KB Output is correct

Subtask #4
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 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 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 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 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 Incorrect 0 ms 384 KB Output isn't correct
14 Halted 0 ms 0 KB -