Submission #1211422

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211422		thelegendary08	Lamps (JOI19_lamps)	C++17	100 / 100	93 ms	72864 KiB

lamp

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in(n);
	string s,t;
	cin>>s>>t;
	vi a, b;
	f0r(i, n){
		a.pb(s[i] - '0');
		b.pb(t[i] - '0');
	}
	
	vvi dp(n, vi(3, 4e18));
	dp[0][0] = 1;
	dp[0][1] = 1;
	dp[0][2] = 0;
	if(b[0] == 0){
		dp[0][1]++;
	}
	if(b[0] == 1){
		dp[0][0]++;
	}
	if(a[0] != b[0]){
		dp[0][2]++;
	}
	// out3(dp[0][0], dp[0][1], dp[0][2]);
	FOR(i, 1, n){
		f0r(j, 3){
			f0r(k, 3){
				int ans = dp[i-1][j];
				if(j != k){
					if(k == 0){
						if(j == 1)ans = 4e18;
						else if(j == 2)ans++;
					}
					else if(k == 1){
						if(j == 0)ans = 4e18;
						else if(j == 2)ans++;
					}
				}
				
				int c1;
				if(j==0)c1 = 0;
				else if(j==1)c1 = 1;
				else c1 = a[i-1];
				
				bool x = (c1 != b[i-1]);
				
				int c2;
				if(k==0)c2 = 0;
				else if(k==1)c2 = 1;
				else c2 = a[i];
				
				bool y = (c2 != b[i]);
				
				if(!x && y)ans++;
				
				dp[i][k] = min(dp[i][k], ans);
				
			}
		}
	}
	out(min(dp[n-1][0], min(dp[n-1][1], dp[n-1][2])));
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 4 / 4
• Subtask 4: 49 / 49