답안 #392090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392090 2021-04-20T13:27:18 Z qwerasdfzxcl Lamps (JOI19_lamps) C++14
4 / 100
20 ms 12248 KB
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
string x, y;
int dp[1001000][2];

int main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n >> x >> y;
    int pt[2] = {-2, -2}, pt2=-2;
    if (x[0]!=y[0]) dp[0][0]=1, pt2=0;
    dp[0][1] = 1;
    pt[y[0]-'0']=0;
    for (int i=1;i<n;i++){
        if (x[i]==y[i]) dp[i][0]=min(dp[i-1][0], dp[i-1][1]);
        else{
            if (x[i-1]!=y[i-1]) dp[i][0] = min(dp[i-1][0], dp[i-1][1]+1);
            else if (pt2==-2) dp[i][0] = min(dp[i-1][0], dp[i-1][1])+1;
            else dp[i][0] = min(min(dp[i-1][0], dp[i-1][1]), dp[pt2][0])+1;
            pt2=i;
        }
        if (y[i-1]==y[i]) dp[i][1] = min(dp[i-1][1], dp[i-1][0]+1), pt[y[i]-'0']=i;
        else{
            if (pt[y[i]-'0']==-2) dp[i][1] = min(dp[i-1][0], dp[i-1][1])+1;
            else dp[i][1] = min(min(dp[i-1][0], dp[i-1][1]), dp[pt[y[i]-'0']][1])+1;
            pt[y[i]-'0']=i;
        }
    }
    /*for (int i=0;i<n;i++) cout << dp[i][0] << ' ';
    cout << '\n';
    for (int i=0;i<n;i++) cout << dp[i][1] << ' ';
    cout << '\n';*/
    for (int i=1;i<n;i++){
        assert(min(dp[i][0], dp[i][1])-min(dp[i-1][0], dp[i-1][1])<=1);
        assert(dp[i][0]-dp[i-1][0]<=1);
        assert(dp[i][1]-dp[i-1][1]<=1);
        assert(min(dp[i][0], dp[i][1])-min(dp[i-1][0], dp[i-1][1])>=0);
        //assert(dp[i][0]-dp[i-1][0]>=0);
        //assert(dp[i][1]-dp[i-1][1]>=0);
        assert(dp[i][1]-dp[i][0]<=1);
    }
    cout << min(dp[n-1][0], dp[n-1][1]);
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Incorrect 1 ms 284 KB Output isn't correct
14 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Incorrect 1 ms 284 KB Output isn't correct
14 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 16 ms 12164 KB Output is correct
8 Correct 16 ms 12188 KB Output is correct
9 Correct 16 ms 12148 KB Output is correct
10 Correct 16 ms 12196 KB Output is correct
11 Correct 20 ms 12248 KB Output is correct
12 Correct 15 ms 12108 KB Output is correct
13 Correct 16 ms 12188 KB Output is correct
14 Correct 16 ms 12180 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Incorrect 1 ms 284 KB Output isn't correct
14 Halted 0 ms 0 KB -