// oooo
/*
har chi delet mikhad bebar ~
gitar o ba khodet nabar! ~
;Amoo_Hasan;
*/
#include<bits/stdc++.h>
//#pragma GCC optimize("O3,no-stack-protector,unroll-loops")
//#pragma GCC target("avx2,fma")
using namespace std;
typedef long long ll;
typedef long double ld;
#define Sz(x) int((x).size())
#define All(x) (x).begin(), (x).end()
#define wtf(x) cout<<#x <<" : " <<x <<endl
constexpr ll inf = 1e18, N = 2e3 + 10;
int cnt[N][N][2];
int dp[N];
int main() {
ios :: sync_with_stdio(0), cin.tie(0);
int n; cin >>n;
string A, B; cin >>A >>B;
assert(n <= 2000);
/* for(int i = 0; i < n; i++) {
for(int j = i; j < n; j++) {
cnt[i][j][0] = (B[j] == '0');
cnt[i][j][1] = (B[j] == '1');
if(i == j) continue;
cnt[i][j][0] -= (B[j - 1] == '0' && B[j] == '0');
cnt[i][j][1] -= (B[j - 1] == '1' && B[j] == '1');
cnt[i][j][0] += cnt[i][j - 1][0];
cnt[i][j][1] += cnt[i][j - 1][1];
}
}
cout<<cnt[0][n - 1][1];
return 0;
*/
for(int i = 0; i < n; i++)
for(int j = i; j < n; j++) {
for(int k = i; k <= j; k++) {
if(B[k] == '1' && (k == j || B[k + 1] == '0')) cnt[i][j][1]++;
if(B[k] == '0' && (k == j || B[k + 1] == '1')) cnt[i][j][0]++;
}
}
int pos = 0;
if(A[0] != B[0]) pos = -1, dp[0] = 1;
for(int i = 1; i < n; i++) {
if(A[i] == B[i]) {
dp[i] = dp[i - 1];
pos = i;
continue;
}
if(pos == -1) {
dp[i] = 1;
continue;
}
dp[i] = dp[pos] + 1;
for(int j = i; j >= 0; j--) {
int val = 0;
if(j > 0) val = dp[j - 1];
val += 1 + min(cnt[j][i][0], cnt[j][i][1]);
dp[i] = min(dp[i], val);
}
// wtf(i), wtf(pos), wtf(dp[i]), wtf(cnt[0][i][1]), wtf(cnt[0][i][0]);
}
cout<<dp[n - 1];
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
0 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
0 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Runtime error |
6 ms |
4644 KB |
Execution killed with signal 6 |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
0 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
