Submission #126403

#	Time	Username	Problem	Language	Result	Execution time	Memory
126403		TadijaSebez	Lamps (JOI19_lamps)	C++11	4 / 100	31 ms	22008 KiB

lamp

#include <bits/stdc++.h>
using namespace std;
const int N=1000050;
const int inf=1e9+7;
char a[N],b[N];
int dp[N][5];
int main()
{
	int n;
	scanf("%i",&n);
	scanf("%s",a+1);
	scanf("%s",b+1);
	dp[0][0]=0;
	dp[0][1]=inf;
	dp[0][2]=inf;
	dp[0][3]=inf;
	dp[0][4]=inf;
	for(int i=1;i<=n;i++)
	{
		if(a[i]!=b[i])
		{
			dp[i][1]=min(dp[i-1][1],dp[i-1][0]+1);
			dp[i][1]=min(dp[i][1],dp[i-1][3]);
			dp[i][1]=min(dp[i][1],dp[i-1][2]+1);
			dp[i][1]=min(dp[i][1],dp[i-1][4]);
			dp[i][0]=inf;
			dp[i][4]=inf;
		}
		else
		{
			dp[i][1]=inf;
			dp[i][4]=min(dp[i-1][1]+1,dp[i-1][0]+2);
			dp[i][4]=min(dp[i][4],dp[i-1][4]);
			dp[i][0]=min(dp[i-1][1],dp[i-1][0]);
			dp[i][0]=min(dp[i][0],dp[i-1][2]);
			dp[i][0]=min(dp[i][0],dp[i-1][3]);
		}
		dp[i][2]=min(dp[i-1][2]+(b[i]!=b[i-1]),dp[i-1][0]+1);
		dp[i][3]=min(dp[i-1][3]+(b[i]!=b[i-1]),dp[i-1][1]+1);
	}
	int ans=min(dp[n][0],dp[n][1]);
	ans=min(ans,dp[n][2]);
	ans=min(ans,dp[n][3]);
	ans=min(ans,dp[n][4]);
	printf("%i\n",ans);
	return 0;
}

Compilation message (stderr)

lamp.cpp: In function 'int main()':
lamp.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
lamp.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",a+1);
  ~~~~~^~~~~~~~~~
lamp.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",b+1);
  ~~~~~^~~~~~~~~~

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