Submission #937568

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
937568	2024-03-04T08:47:18 Z	WonderfulWhale	Lamps (JOI19_lamps)	C++17	0 / 100	1000 ms	62164 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[2009][2][2][2009];

int dis[5][5] = {
	{0, 1, 1, 2, 2},
	{0, 0, 1, 1, 2},
	{0, 1, 0, 2, 1},
	{0, 0, 0, 0, 1},
	{0, 0, 0, 1, 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<=n;j++) {
			dp[i][0][0][j] = dp[i][1][0][j] = 1e9;
			dp[i][0][1][j] = dp[i][1][1][j] = 1e9;
		}
	}
	dp[0][0][0][0] = 0;
	dp[0][0][1][0] = 0;
	string A, B;
	cin >> A >> B;
	for(int i=1;i<=n;i++) {
		for(int j1=0;j1<2;j1++) {
			for(int j2=0;j2<2;j2++) {
				for(int j3=0;j3<=n;j3++) {
					for(int k1=0;k1<2;k1++) {
						for(int k2=0;k2<2;k2++) {
							for(int k3=0;k3<=n;k3++) {
								int New = A[i-1]-'0';
								if(k1) New = 1-New;
								if(k3)
									New = (k2+k3)%2;
								if(New!=B[i-1]-'0') continue;
								bool is = k1&&(!j1);
								int is2 = 0;
								if(j2==k2) is2 = max(is2, k3-j3);
								else is2 = k3;
								dp[i][k1][k2][k3] = min(dp[i][k1][k2][k3], 
										dp[i-1][j1][j2][j3]+is+is2);
							}
						}
					}
				}
			}
		}
	}
	int ans = 1e9;
	for(int i=0;i<=n;i++) {
		ans = min({ans, dp[n][0][0][i], dp[n][1][0][i]});
		ans = min({ans, dp[n][0][1][i], dp[n][1][1][i]});
	}
	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	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2556 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	2 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Incorrect	1 ms	2648 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	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2556 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	2 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Incorrect	1 ms	2648 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	344 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	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Execution timed out	1063 ms	62164 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	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 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	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2556 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	2 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Incorrect	1 ms	2648 KB	Output isn't correct
27	Halted	0 ms	0 KB	-