# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
792618 |
2023-07-25T07:29:05 Z |
vjudge1 |
Lamps (JOI19_lamps) |
C++17 |
|
26 ms |
64332 KB |
#ifdef Home
#define _GLIBCXX_DEBUG
#endif // Home
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2022;
string a, b;
int dp[N][N][4];
// 0 don't touched
// 1 turn off all
// 2 turn on all
// 3 toggle all
int change(int pr, int cr) {
return cr == 3 ? 3 - pr : (cr ? cr : pr);
}
int recur(int l, int r, int sts) {
int &ans = dp[l][r][sts];
if(ans != -1) {
return ans;
}
if(l + 1 == r) {
if(sts == 0) {
return ans = (a[l] != b[l]);
}
if(sts == 1) {
return ans = ('0' != b[l]);
}
if(sts == 2) {
return ans = ('1' != b[l]);
}
return ans = (a[l] == b[l]);
}
ans = r - l;
for(int m = l + 1; m < r; ++ m) {
int ansl = recur(l, m, sts);
for(int nwsts = 1; nwsts < 4; ++ nwsts) {
ansl = min(ansl, recur(l, m, change(sts, nwsts)) + 1);
}
int ansr = recur(m, r, sts);
for(int nwsts = 1; nwsts < 4; ++ nwsts) {
ansr = min(ansr, recur(m, r, change(sts, nwsts)) + 1);
}
ans = min(ans, ansl + ansr);
}
return ans;
}
main() {
#ifdef Home
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // Home
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(dp, -1, sizeof dp);
int n;
cin >> n >> a >> b;
bool ok = a[0] == '0';
int ans = a[0] != b[0];
for(int i = 1; i < a.size(); ++ i) {
ok &= a[i] == '0';
ans += (b[i] == a[i] && b[i - 1] != a[i - 1]);
}
if(ok) {
cout << ans;
return 0;
}
cout << min( {
recur(0, n, 0),
recur(0, n, 1) + 1,
recur(0, n, 2) + 1,
recur(0, n, 3) + 1} );
}
Compilation message
lamp.cpp:58:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
58 | main() {
| ^~~~
lamp.cpp: In function 'int main()':
lamp.cpp:72:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | for(int i = 1; i < a.size(); ++ i) {
| ~~^~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
64264 KB |
Output is correct |
2 |
Correct |
23 ms |
64332 KB |
Output is correct |
3 |
Correct |
22 ms |
64320 KB |
Output is correct |
4 |
Correct |
26 ms |
64280 KB |
Output is correct |
5 |
Correct |
23 ms |
64268 KB |
Output is correct |
6 |
Correct |
22 ms |
64260 KB |
Output is correct |
7 |
Correct |
22 ms |
64212 KB |
Output is correct |
8 |
Incorrect |
22 ms |
64212 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
64264 KB |
Output is correct |
2 |
Correct |
23 ms |
64332 KB |
Output is correct |
3 |
Correct |
22 ms |
64320 KB |
Output is correct |
4 |
Correct |
26 ms |
64280 KB |
Output is correct |
5 |
Correct |
23 ms |
64268 KB |
Output is correct |
6 |
Correct |
22 ms |
64260 KB |
Output is correct |
7 |
Correct |
22 ms |
64212 KB |
Output is correct |
8 |
Incorrect |
22 ms |
64212 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
64208 KB |
Output is correct |
2 |
Correct |
24 ms |
64268 KB |
Output is correct |
3 |
Correct |
23 ms |
64312 KB |
Output is correct |
4 |
Incorrect |
24 ms |
64216 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
64264 KB |
Output is correct |
2 |
Correct |
23 ms |
64332 KB |
Output is correct |
3 |
Correct |
22 ms |
64320 KB |
Output is correct |
4 |
Correct |
26 ms |
64280 KB |
Output is correct |
5 |
Correct |
23 ms |
64268 KB |
Output is correct |
6 |
Correct |
22 ms |
64260 KB |
Output is correct |
7 |
Correct |
22 ms |
64212 KB |
Output is correct |
8 |
Incorrect |
22 ms |
64212 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |