oj.uz

답안 #105856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105856 2019-04-15T10:50:10 Z Alexa2001 Lamps (JOI19_lamps) C++17
4 / 100
 27 ms 18216 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; ++i)
        if(a[i] ^ b[i])
        {
            cnt ++;
            for(j=i+1; j<=n; ++j)
                if(a[j] == 0 && b[j] == 1) break;

            i = j;
        }

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

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 396 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 396 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 356 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 26 ms 18104 KB Output is correct
8 Correct 23 ms 18100 KB Output is correct
9 Correct 26 ms 18096 KB Output is correct
10 Correct 27 ms 18156 KB Output is correct
11 Correct 26 ms 18104 KB Output is correct
12 Correct 23 ms 18132 KB Output is correct
13 Correct 25 ms 18124 KB Output is correct
14 Correct 25 ms 18216 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 396 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Halted 0 ms 0 KB -