oj.uz

Submission #428042

# Submission time Handle Problem Language Result Execution time Memory
428042 2021-06-15T07:36:01 Z tengiz05 Lamps (JOI19_lamps) C++17
4 / 100
 10 ms 15952 KB 
#include <bits/stdc++.h>
int dp[2000][2000];
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n;
    std::cin >> n;
    if (n > 500) {
        std::string a, b;
        std::cin >> a >> b;
        int ans = 0;
        for (int i = 0; i < n; i++) {
            if (b[i] != '1') {
                continue;
            }
            while (i + 1 < n && b[i + 1] == '1') {
                i++;
            }
            ans++;
        }
        std::cout << ans << "\n";
    } else {
        std::string a[2], b;
        std::cin >> a[0] >> b;
        a[1] = a[0];
        for (int i = 0; i < n; i++) {
            a[1][i] ^= 1;
        }
        auto cost = [&](char c, int l, int r) {
            int ans = 0;
            for (int i = l; i <= r; i++) {
                if (c != b[i]) {
                    while (i + 1 <= r && b[i + 1] != c) {
                        i++;
                    }
                    ans++;
                }
            }
            return ans;
        };
        auto xorcost = [&](int l, int r, int f) {
            int ans = 0;
            for (int i = l; i <= r; i++) {
                if (a[f][i] != b[i]) {
                    while (i + 1 <= r && b[i + 1] != a[f][i + 1]) {
                        i++;
                    }
                    ans++;
                }
            }
            return ans;
        };
        memset(dp, -1, sizeof dp);
        std::function<int(int, int)> calc = [&](int l, int r) {
            if (l == r) {
                return int(a[0][l] != b[l]);
            }
            int &ret = dp[l][r];
            if (~ret) {
                return ret;
            }
            ret = 1000000;
            ret = std::min(ret, cost('0', l, r) + bool(std::count(a[0].begin() + l, a[0].begin() + r + 1, '1')));
            ret = std::min(ret, cost('1', l, r) + bool(std::count(a[0].begin() + l, a[0].begin() + r + 1, '0')));
            ret = std::min(ret, xorcost(l, r, 0));
            ret = std::min(ret, xorcost(l, r, 1) + 1);
            for (int i = l; i < r; i++) {
                ret = std::min(ret, calc(l, i) + calc(i + 1, r));
            }
            return ret;
        };
        std::cout << calc(0, n - 1) << "\n";
    }
    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 7 ms 15948 KB Output is correct
3 Correct 7 ms 15952 KB Output is correct
4 Correct 7 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 9 ms 15948 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 8 ms 15900 KB Output is correct
9 Correct 7 ms 15948 KB Output is correct
10 Correct 8 ms 15948 KB Output is correct
11 Correct 8 ms 15948 KB Output is correct
12 Correct 8 ms 15948 KB Output is correct
13 Incorrect 7 ms 15948 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 7 ms 15948 KB Output is correct
3 Correct 7 ms 15952 KB Output is correct
4 Correct 7 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 9 ms 15948 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 8 ms 15900 KB Output is correct
9 Correct 7 ms 15948 KB Output is correct
10 Correct 8 ms 15948 KB Output is correct
11 Correct 8 ms 15948 KB Output is correct
12 Correct 8 ms 15948 KB Output is correct
13 Incorrect 7 ms 15948 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15948 KB Output is correct
2 Correct 8 ms 15948 KB Output is correct
3 Correct 10 ms 15948 KB Output is correct
4 Correct 10 ms 15892 KB Output is correct
5 Correct 9 ms 15948 KB Output is correct
6 Correct 10 ms 15948 KB Output is correct
7 Correct 5 ms 2664 KB Output is correct
8 Correct 6 ms 2664 KB Output is correct
9 Correct 6 ms 2664 KB Output is correct
10 Correct 6 ms 2664 KB Output is correct
11 Correct 7 ms 2664 KB Output is correct
12 Correct 6 ms 2672 KB Output is correct
13 Correct 5 ms 2664 KB Output is correct
14 Correct 6 ms 2664 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 15948 KB Output is correct
2 Correct 7 ms 15948 KB Output is correct
3 Correct 7 ms 15952 KB Output is correct
4 Correct 7 ms 15948 KB Output is correct
5 Correct 7 ms 15948 KB Output is correct
6 Correct 9 ms 15948 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 8 ms 15900 KB Output is correct
9 Correct 7 ms 15948 KB Output is correct
10 Correct 8 ms 15948 KB Output is correct
11 Correct 8 ms 15948 KB Output is correct
12 Correct 8 ms 15948 KB Output is correct
13 Incorrect 7 ms 15948 KB Output isn't correct
14 Halted 0 ms 0 KB -