oj.uz

답안 #376165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
376165 2021-03-11T02:54:46 Z wiwiho Lamps (JOI19_lamps) C++14
4 / 100
 17 ms 6964 KB 
#include <bits/stdc++.h>

#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

int gettype(vector<int>& now){
    int n = now.size();
    int diff = 0;
    for(int i = 0; i < n; i++){
        if(now[i] == 1) diff++;
    }
    if(diff == 0) return 3;
    else if(diff == n) return 2;
    int l = 0, r = 0;
    for(int i = 0; i < n && now[i] == 1; i++) l++;
    for(int i = n - 1; i >= 0 && now[i] == 1; i--) r++;
    if(l + r != diff) return 4;
    if(r == 0) return 5;
    if(l == 0) return 6;
    return 1;
}

vector<int> v;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    string a, b;
    cin >> n >> a >> b;
    a += ' ';
    b += ' ';

    vector<int> now;
    char lst = 0;
    int ans = 0;
    for(int i = 0; i <= n; i++){
        if(i != 0 && b[i] != lst && !now.empty()){
            int t = gettype(now);
            now.clear();
            if(t == 4) ans++;
            else v.eb(t);
        }
        lst = b[i];
        now.eb(a[i] != b[i]);
    }
    int m = v.size();
    //printv(v, cerr);
    //printv(del, cerr);

    bool tmp = false;
    for(int i = 0; i < m; i++){
        if(v[i] == 1){
            ans++;
        }
        if(v[i] == 2){
            tmp = true;
        }
        if(v[i] == 3){
            if(tmp) ans++;
            tmp = false;
        }
        if(v[i] == 5){
            ans++;
            tmp = false;
        }
        if(v[i] == 6){
            if(tmp) ans++;
            tmp = true;
        }
    }
    if(tmp) ans++;

    cout << ans << "\n";

    return 0;
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 41.0

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

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 12 ms 6964 KB Output is correct
8 Correct 17 ms 6964 KB Output is correct
9 Correct 17 ms 6964 KB Output is correct
10 Correct 17 ms 6964 KB Output is correct
11 Correct 17 ms 6964 KB Output is correct
12 Correct 12 ms 6964 KB Output is correct
13 Correct 9 ms 2824 KB Output is correct
14 Correct 9 ms 2824 KB Output is correct

Subtask #4
0 / 49.0

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