Submission #1543600


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
static_assert(sizeof(long) >= 8, "sizeof(long) >= 8");
int eval(int s, int cl, int cr) {
    // fprintf(stderr, "%d %d %d %d\n", s, cl, cr, abs(s) + max(0, cr - max(0, s)) * 2 + max(0, cl - max(0, -s)) * 2);
    return max(0, cr - max(0, s)) * 2 + max(0, cl - max(0, -s)) * 2;
}
// static_assert(eval(-10, 5, 5) == 20);
// static_assert(eval(10, 5, 5) == 20);
// static_assert(eval(10, 0, 11) == 12);
// static_assert(eval(-10, 11, 0) == 12);
char a[6000], b[6000];
int ll[6000], lr[6000];
pair<int, int> c[2000];
int main() {
    scanf("%s%s", a, b);
    int n = strlen(a);
    if (strcmp(a, b) == 0) {
        puts("0");
        return 0;
    }
    if (!strchr(b, '1')) {
        puts("-1");
        return 0;
    }
    copy_n(a, n, a + n);
    copy_n(a, n, a + 2 * n);
    copy_n(b, n, b + n);
    copy_n(b, n, b + 2 * n);
    for (int i = 1; i < 2 * n; i++)
        ll[i] = b[i] == '1' ? 0 : ll[i - 1] + 1;
    for (int i = 3 * n - 2; i >= n; i--)
        lr[i] = b[i] == '1' ? 0 : lr[i + 1] + 1;
    int ans = 2 * n;
    for (int s = -n; s <= n; s++) {
        int cur = abs(s), m = 0;
        for (int i = n; i < 2 * n; i++)
            if (a[i] != b[i + s]) {
                cur++;
                if (a[i] == '1')
                    c[m++] = make_pair(ll[i], lr[i]);
            }

        if (m) {
            sort(c, c + m);
            int cur1 = eval(s, c[m - 1].first, 0);
            for (int i = m - 1, cr = 0; i >= 0; i--) {
                cr = max(cr, c[i].second);
                cur1 = min(cur1, eval(s, i ? c[i - 1].first : 0, cr));
            }
            cur += cur1;
        }
        ans = min(ans, cur);
    }
    printf("%d\n", ans);
}

Submission Info

Submission Time
Task D - Shift and Flip
User johnchen902
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1842 Byte
Status AC
Exec Time 249 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s%s", a, b);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 4
AC × 54
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt
Case Name Status Exec Time Memory
sample_01.txt AC 0 ms 128 KB
sample_02.txt AC 0 ms 128 KB
sample_03.txt AC 0 ms 128 KB
sample_04.txt AC 0 ms 128 KB
subtask_1_01.txt AC 0 ms 128 KB
subtask_1_02.txt AC 0 ms 128 KB
subtask_1_03.txt AC 0 ms 128 KB
subtask_1_04.txt AC 0 ms 128 KB
subtask_1_05.txt AC 8 ms 256 KB
subtask_1_06.txt AC 0 ms 128 KB
subtask_1_07.txt AC 0 ms 128 KB
subtask_1_08.txt AC 0 ms 128 KB
subtask_1_09.txt AC 0 ms 128 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 124 ms 256 KB
subtask_1_12.txt AC 58 ms 256 KB
subtask_1_13.txt AC 129 ms 256 KB
subtask_1_14.txt AC 130 ms 256 KB
subtask_1_15.txt AC 144 ms 256 KB
subtask_1_16.txt AC 156 ms 256 KB
subtask_1_17.txt AC 180 ms 256 KB
subtask_1_18.txt AC 224 ms 256 KB
subtask_1_19.txt AC 249 ms 256 KB
subtask_1_20.txt AC 243 ms 256 KB
subtask_1_21.txt AC 66 ms 256 KB
subtask_1_22.txt AC 66 ms 256 KB
subtask_1_23.txt AC 137 ms 256 KB
subtask_1_24.txt AC 138 ms 256 KB
subtask_1_25.txt AC 138 ms 256 KB
subtask_1_26.txt AC 1 ms 128 KB
subtask_1_27.txt AC 1 ms 128 KB
subtask_1_28.txt AC 3 ms 128 KB
subtask_1_29.txt AC 15 ms 256 KB
subtask_1_30.txt AC 67 ms 256 KB
subtask_1_31.txt AC 0 ms 128 KB
subtask_1_32.txt AC 1 ms 128 KB
subtask_1_33.txt AC 1 ms 128 KB
subtask_1_34.txt AC 4 ms 128 KB
subtask_1_35.txt AC 23 ms 256 KB
subtask_1_36.txt AC 101 ms 256 KB
subtask_1_37.txt AC 1 ms 128 KB
subtask_1_38.txt AC 1 ms 128 KB
subtask_1_39.txt AC 6 ms 128 KB
subtask_1_40.txt AC 26 ms 256 KB
subtask_1_41.txt AC 99 ms 256 KB
subtask_1_42.txt AC 93 ms 256 KB
subtask_1_43.txt AC 100 ms 256 KB
subtask_1_44.txt AC 111 ms 256 KB
subtask_1_45.txt AC 105 ms 256 KB
subtask_1_46.txt AC 108 ms 256 KB