제출 #766790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766790		Dorost	Lamps (JOI19_lamps)	C++17	100 / 100	53 ms	27900 KiB

lamp

/*  * In the name of GOD  */

#include "bits/stdc++.h"

using namespace std;

typedef long long ll; 
typedef pair <int, int> pii;
#define F first
#define S second
#define mk make_pair
const int N = 1012345;
int dp[N][3][2];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    int n, ans = N;
    string a, b;
    cin >> n >> a >> b;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= 2; j++) {
            for (int k = 0; k <= 1; k++) {
                dp[i][j][k] = N;
                if (i == 0) {
                    if (j == 2 && k == 0)
                        dp[i][j][k] = 0;
                    continue;
                }
                int x = (j == 2 ? a[i - 1] - '0' : j); 
                x ^= k;
                if (x != b[i - 1] - '0') {
                    continue;
                }
                for (int j2 = 0; j2 <= 2; j2++) {
                    for (int k2 = 0; k2 <= 1; k2++) {
                        dp[i][j][k] = min(dp[i][j][k], dp[i - 1][j2][k2] + ((j != 2) && (j2 != j)) + ((k != 0) && (k != k2)));
                    }
                }
                if (i == n)
                    ans = min(ans, dp[i][j][k]);
            }
        }
    }   
    cout << ans << '\n';
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 4 / 4
• Subtask 4: 49 / 49