제출 #1278193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1278193		PlayVoltz	Lamps (JOI19_lamps)	C++20	0 / 100	73 ms	71736 KiB

lamp

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
using namespace std;
 
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	string s;
	cin>>n>>s;
	vector<int> a(n), b(n);
	for (int i=0; i<n; ++i)a[i]=(s[i]=='1');
	cin>>s;
	for (int i=0; i<n; ++i)b[i]=(s[i]=='1');
	vector<vector<int> > dp(n, vector<int>(3));
	dp[0][0]=a[0]^b[0];
	dp[0][1]=1+b[0];
	dp[0][2]=1+!b[0];
	for (int i=1; i<n; ++i){
		dp[i][0]=dp[i-1][0]+(a[i]!=b[i]&&a[i-1]==b[i-1]);
		dp[i][0]=min(dp[i][0], dp[i-1][1]+(a[i]!=b[i]&&b[i-1]));
		dp[i][0]=min(dp[i][0], dp[i-1][2]+(a[i]!=b[i]&&!b[i-1]));
		dp[i][1]=dp[i-1][0]+(b[i]&&a[i-1]==b[i-1])+1;
		dp[i][1]=min(dp[i][1], dp[i-1][1]+(b[i]&&b[i-1]));
		dp[i][1]=min(dp[i][1], dp[i-1][2]+(b[i]&&!b[i-1])+1);
		dp[i][2]=dp[i-1][0]+(!b[i]&&a[i-1]==b[i-1])+1;
		dp[i][2]=min(dp[i][2], dp[i-1][1]+(!b[i]&&b[i-1])+1);
		dp[i][2]=min(dp[i][2], dp[i-1][2]+(!b[i]&&!b[i-1]));
	}
	cout<<min({dp[n-1][0], dp[n-1][1], dp[n-1][2]});
}

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