Submission #735294

#	Time	Username	Problem	Language	Result	Execution time	Memory
735294		Ronin13	Lamps (JOI19_lamps)	C++14	100 / 100	231 ms	35604 KiB

lamp

#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

const int nmax = 1001;



int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n; cin >> n;
    char a[n + 1], b[n + 1];
    for(int  i = 1; i <= n; i++)
        cin >> a[i];
    for(int j = 1; j <= n; j++){
        cin >> b[j];
    }
    int dp[n + 1][8];
    for(int i = 0; i <= n; ++i){
        for(int j = 0; j < 8; j++)
            dp[i][j] = 1e9;
    }
    dp[0][0] = 0;
    for(int i =1 ; i <= n; i++){
        for(int x = 0; x < 8; x++){
            if((x & 3) == 3) continue;
            for(int y = 0; y < 8; y++){
                if((y & 3) == 3) continue;
                int cost = __builtin_popcount((x ^ y) & y);
                int nw = a[i] - '0';
                if(y & 1) nw = 0;
                if(y & 2) nw = 1;
                if(y & 4) nw ^= 1;
                if(nw == (b[i] - '0'))
                    dp[i][y] = min(dp[i][y], dp[i - 1][x] + cost);
            }
        }
    }
    int ans = 1e9;
    for(int j = 0; j < 8; j++)
        ans = min(ans, dp[n][j]);
    cout << ans;
    return 0;
}

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