Submission #379559

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
379559	2021-03-18T15:10:57 Z	nafis_shifat	Lamps (JOI19_lamps)	C++14	10 / 100	287 ms	72828 KB

lamp

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int mxn=1e5+5;
const int inf=1e9;

int get(int x,int op) {
	if(op == 0) return 0;
	if(op == 1) return 1;
	if(op == 2) return x ^ 1;
	return x;
}
int op(int a) {
	return a != 3;
}
int op(int a,int b) {
	return (a != 3) + (b != 3);
}
int main() {
	int n;
	cin >> n;
	int dp[n + 1][4][4] = {};

	int a[n + 1];
	int b[n + 1];

	for(int i = 1; i <= n; i++) {
		char c;
		cin >> c;
		c -= '0';
		a[i] = c;
	}

	for(int i = 1; i <= n; i++) {
		char c;
		cin >> c;
		c -= '0';
		b[i] = c;
	}

	int lm = inf;



	for(int i = 0; i < 4; i++) {
		for(int j = 0; j < 4; j++) {
			int x = get(a[1],i);
			int y = get(x,j);

			if(y == b[1]) dp[1][i][j] = op(i,j);
			else dp[1][i][j] = inf;
			lm = min(lm,dp[1][i][j]);
		}
	}




	for(int i = 2; i <= n; i++) {
		int cm = inf;
		for(int j = 0; j < 4; j++) {
			for(int k = 0; k < 4; k++) {
				int x = get(a[i],j);
			    int y = get(x,k);
			    if(y != b[i]) dp[i][j][k] = inf;
			    else {
			    	int &r = dp[i][j][k];
			    	r = dp[i - 1][j][k];
			    	r = min(r,lm + op(j,k));
			    	for(int x = 0; x < 4; x++) r = min(r,dp[i - 1][x][j] + op(k));
			    	for(int x = 0; x < 4; x++) r = min(r,dp[i - 1][j][x] + op(k));
			    	cm = min(cm,dp[i][j][k]);

			    }				
			}
		}
		lm = cm;
	}
	
	cout<<lm<<endl;



}

Subtask #1
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct

Subtask #2
0 / 41.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	492 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	1 ms	640 KB	Output is correct
40	Incorrect	2 ms	492 KB	Output isn't correct
41	Halted	0 ms	0 KB	-

Subtask #3
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	2 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	278 ms	71012 KB	Output is correct
8	Correct	287 ms	71068 KB	Output is correct
9	Correct	279 ms	72680 KB	Output is correct
10	Correct	286 ms	72828 KB	Output is correct
11	Correct	283 ms	72784 KB	Output is correct
12	Correct	276 ms	72812 KB	Output is correct
13	Correct	281 ms	72812 KB	Output is correct
14	Correct	286 ms	72812 KB	Output is correct

Subtask #4
0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	492 KB	Output is correct
36	Correct	1 ms	492 KB	Output is correct
37	Correct	1 ms	492 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	1 ms	640 KB	Output is correct
40	Incorrect	2 ms	492 KB	Output isn't correct
41	Halted	0 ms	0 KB	-

Submission #379559

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 0 / 41.0

Subtask #3 4.0 / 4.0

Subtask #4 0 / 49.0

Subtask #1
6.0 / 6.0

Subtask #2
0 / 41.0

Subtask #3
4.0 / 4.0

Subtask #4
0 / 49.0