oj.uz

Submission #105854

# Submission time Handle Problem Language Result Execution time Memory
105854 2019-04-15T10:46:15 Z Alexa2001 Lamps (JOI19_lamps) C++17
4 / 100
 27 ms 19404 KB 
#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])
        {
            cnt ++;
            for(j=i+1; j<=n+1; ++j)
                if(a[j] == 0 && b[j] == 1) break;

            if(j == n+2) --cnt;
            i = j;
        }

    cout << cnt << '\n';
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 23 ms 19148 KB Output is correct
8 Correct 24 ms 19400 KB Output is correct
9 Correct 27 ms 19352 KB Output is correct
10 Correct 25 ms 19400 KB Output is correct
11 Correct 25 ms 19404 KB Output is correct
12 Correct 24 ms 19384 KB Output is correct
13 Correct 25 ms 19400 KB Output is correct
14 Correct 25 ms 19404 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -