제출 #335508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335508		alishahali1382	Lamps (JOI19_lamps)	C++14	100 / 100	275 ms	43708 KiB

lamp

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=1000010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int dp[MAXN][10];
int W[10][10], F[10], mark[10];
string A, B;

inline void upd(int &x, int y){ if (x>y) x=y;}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	W[0][1]=W[0][2]=1;
	W[0][3]=W[0][4]=2;
	W[1][2]=W[1][3]=1;
	W[1][4]=2;
	W[2][1]=W[2][4]=1;
	W[2][3]=2;
	W[3][4]=W[4][3]=2;
	for (int i=0; i<5; i++) for (int j=0; j<5; j++){
		W[i][j+5]=W[i][j]+1;
		W[i+5][j+5]=W[i+5][j]=W[i][j];
	}
	F[2]=F[3]=F[6]=F[9]=1;
	
	cin>>n>>A>>B;
	for (int i=0; i<10; i++) dp[0][i]=W[0][i];
	for (int i=1; i<=n; i++){
		memcpy(dp[i], dp[i-1], sizeof(dp[i]));
		if (A[i-1]==B[i-1]) dp[i][5]=inf;
		else dp[i][0]=inf;
		for (int j=0; j<10; j++) if (j%5 && F[j]!=B[i-1]-'0') dp[i][j]=inf;
		
		fill(mark, mark+10, 0);
		for (int j=0; j<10; j++){
			int v=-1;
			for (int k=0; k<10; k++) if (!mark[k] && (v==-1 || dp[i][v]>dp[i][k])) v=k;
			mark[v]=1;
			for (int k=0; k<10; k++) if (!mark[k]) upd(dp[i][k], dp[i][v]+W[v][k]);
		}
	}
	ans=inf;
	for (int i=0; i<10; i++) upd(ans, dp[n][i]);
	cout<<ans<<"\n";
	
	return 0;
}

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