# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1116768 |
2024-11-22T10:56:47 Z |
firewater |
Lamps (JOI19_lamps) |
C++14 |
|
63 ms |
51408 KB |
#include<bits/stdc++.h>
#define N 1001000
using namespace std;
int n,ans,a[N],b[N],f[N][5][2];
char s1[N],s2[N];
int main()
{
scanf("%d%s%s",&n,s1+1,s2+1);
for(int i=1;i<=n;++i)
a[i]=s2[i]-'0'+1,b[i]=(s1[i]!=s2[i]);
memset(f,127/3,sizeof(f));
f[0][0][0]=0;
for(int i=1;i<=n;++i)
for(int j=0;j<=2;++j)
for(int k=0;k<=1;++k){
f[i][0][b[i]]=min(f[i][0][b[i]],f[i-1][j][k]+(b[i]&&(b[i]!=k)));
if(j){
f[i][j][k]=min(f[i][j][k],f[i-1][j][k]+(a[i]!=j&&a[i]!=a[i-1]));
f[i][j][k%2+1]=min(f[i][j][k%2+1],f[i-1][j][k]+(!k)+(a[i]==j||a[i]==a[i-1]));
}
f[i][a[i]][k]=min(f[i][a[i]][k],f[i-1][j][k]+1);
}
ans=f[0][0][1];
for(int j=0;j<=2;++j)
for(int k=0;k<=1;++k)
ans=min(ans,f[n][j][k]);
printf("%d\n",ans);
return 0;
}
Compilation message
lamp.cpp: In function 'int main()':
lamp.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
8 | scanf("%d%s%s",&n,s1+1,s2+1);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
43344 KB |
Output is correct |
2 |
Correct |
12 ms |
43344 KB |
Output is correct |
3 |
Correct |
14 ms |
43544 KB |
Output is correct |
4 |
Correct |
17 ms |
43344 KB |
Output is correct |
5 |
Correct |
20 ms |
43336 KB |
Output is correct |
6 |
Correct |
14 ms |
43344 KB |
Output is correct |
7 |
Correct |
14 ms |
43440 KB |
Output is correct |
8 |
Correct |
17 ms |
43344 KB |
Output is correct |
9 |
Incorrect |
14 ms |
43344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
43344 KB |
Output is correct |
2 |
Correct |
12 ms |
43344 KB |
Output is correct |
3 |
Correct |
14 ms |
43544 KB |
Output is correct |
4 |
Correct |
17 ms |
43344 KB |
Output is correct |
5 |
Correct |
20 ms |
43336 KB |
Output is correct |
6 |
Correct |
14 ms |
43344 KB |
Output is correct |
7 |
Correct |
14 ms |
43440 KB |
Output is correct |
8 |
Correct |
17 ms |
43344 KB |
Output is correct |
9 |
Incorrect |
14 ms |
43344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
43344 KB |
Output is correct |
2 |
Correct |
19 ms |
43344 KB |
Output is correct |
3 |
Correct |
13 ms |
43344 KB |
Output is correct |
4 |
Correct |
12 ms |
43344 KB |
Output is correct |
5 |
Correct |
14 ms |
43384 KB |
Output is correct |
6 |
Correct |
18 ms |
43472 KB |
Output is correct |
7 |
Correct |
56 ms |
51272 KB |
Output is correct |
8 |
Correct |
55 ms |
51272 KB |
Output is correct |
9 |
Correct |
62 ms |
51280 KB |
Output is correct |
10 |
Correct |
63 ms |
51280 KB |
Output is correct |
11 |
Correct |
51 ms |
51280 KB |
Output is correct |
12 |
Correct |
51 ms |
51408 KB |
Output is correct |
13 |
Correct |
58 ms |
51272 KB |
Output is correct |
14 |
Correct |
53 ms |
51280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
43344 KB |
Output is correct |
2 |
Correct |
12 ms |
43344 KB |
Output is correct |
3 |
Correct |
14 ms |
43544 KB |
Output is correct |
4 |
Correct |
17 ms |
43344 KB |
Output is correct |
5 |
Correct |
20 ms |
43336 KB |
Output is correct |
6 |
Correct |
14 ms |
43344 KB |
Output is correct |
7 |
Correct |
14 ms |
43440 KB |
Output is correct |
8 |
Correct |
17 ms |
43344 KB |
Output is correct |
9 |
Incorrect |
14 ms |
43344 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |