Submission #937580

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
937580	2024-03-04T09:10:56 Z	WonderfulWhale	Lamps (JOI19_lamps)	C++17	0 / 100	1000 ms	112368 KB

lamp

#include<bits/stdc++.h>
using namespace std;

#define int int64_t
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

int dp[1000009][14];

int dis[14][3] = {
	{-1, -1, -1},
	{0, -1, -1},
	{1, -1, -1},
	{2, -1, -1},
	{0, 2, -1},
	{1, 2, -1},
	{2, 0, -1},
	{2, 1, -1},
	{2, 0, 1},
	{0, 2, 1},
	{0, 1, 2},
	{2, 1, 0},
	{1, 2, 0},
	{1, 0, 2}
};

int f(int a, int b) {
	for(int i=0;i<3;i++) {
		if(dis[a][i]!=dis[b][i]) {
			for(int j=0;j<4;j++) {
				if(j==3||dis[b][j]==-1)
					return j-i;
			}
		}
	}
	return 0;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


	int n;
	cin >> n;
	for(int i=0;i<=n;i++) {
		for(int j=0;j<14;j++) {
			dp[i][j] = 1e9;
		}
	}
	dp[0][0] = 0;
	string A, B;
	cin >> A >> B;
	//for(int i=0;i<14;i++) {
		//for(int j=0;j<14;j++) {
			//cout << f(i, j) << " ";
		//}
		//cout << "\n";
	//}
	for(int i=1;i<=n;i++) {
		for(int j=0;j<14;j++) {
			for(int k=0;k<14;k++) {
				int New = A[i-1]-'0';
				for(int I=0;I<3;I++) {
					if(dis[k][I]==0) New = 0;
					if(dis[k][I]==1) New = 1;
					if(dis[k][I]==2) New = 1-New;
				}
				if(New!=B[i-1]-'0') continue;
				dp[i][k] = min(dp[i][k], dp[i-1][j]+f(j, k));
			}
		}
		//for(int j=0;j<14;j++) {
			//cout << i << " " << j << ": " << dp[i][j] << "\n";
		//}
	}
	int ans = 1e9;
	for(int i=0;i<=n;i++) {
		for(int j=0;j<14;j++) {
			ans = min(ans, dp[n][j]);
		}
	}
	cout << ans << "\n";
}

Subtask #1

0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Incorrect	0 ms	348 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #2

0 / 41.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Incorrect	0 ms	348 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #3

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Execution timed out	1071 ms	112368 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #4

0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Incorrect	0 ms	348 KB	Output isn't correct
27	Halted	0 ms	0 KB	-