Submission #105861

#	Time	Username	Problem	Language	Result	Execution time	Memory
105861		Alexa2001	Lamps (JOI19_lamps)	C++17	0 / 100	1073 ms	18116 KiB

lamp

#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e6 + 5;

int a[Nmax], b[Nmax], a0[Nmax], b0[Nmax];
int i, n;

int main()
{
//    freopen("input", "r", stdin);
    cin.sync_with_stdio(false);

    cin >> n;
    string A, B;
    cin >> A >> B;

    for(i=1; i<=n; ++i)
        a0[i] = A[i-1] - '0', b0[i] = B[i-1] - '0';

    for(i=1; i<=n+1; ++i)
        a[i] = a0[i-1] ^ a0[i], b[i] = b0[i-1] ^ b0[i];

    int cnt = 0, j;

    for(i=1; i<=n+1; ++i)
        if(a[i] ^ b[i])
        {
            int k = -1;

            for(j=i+1; k == -1 && j<=n+1; ++j)
                if(a[j] & b[j]) k = j;

            if(k == -1) k = n+1;

            for(j=k; j>=i && !(a[j] ^ b[j]); --j);

            if(j == i) continue;

            cnt ++;
            a[j] ^= 1; a[i] ^= 1;
            for(--j; j>i; --j) a[j] = 0;
            i = j;
        }

    int cnt2 = 0;
    for(j=1; j<=n+1; ++j)
        if(a[j] ^ b[j]) cnt2 ++;

    cnt += (cnt2+1) / 2;
    cout << cnt << '\n';
    return 0;
}

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