Submission #1556152


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <map>
#include <numeric>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < int(n); ++(i))
#define whole(x) begin(x), end(x)
using namespace std;

int solve(int n, vector<int> const & a, vector<int> const & b) {
    int sum_a = accumulate(whole(a), 0, bit_xor<int>());
    map<int, map<int, int> > g;
    auto link = [&](int x, int y) {
        if (x != y) {
            g[x][y] += 1;
        }
    };
    auto unlink = [&](int x, int y) {
        g[x][y] -= 1;
        if (not g[x][y]) {
            g[x].erase(y);
            if (g[x].empty()) {
                g.erase(x);
            }
        }
    };
    repeat (i, n) {
        link(b[i], a[i]);
    }
    int result = 0;
    for (int i = sum_a; not g.empty(); ++ result) {
        if (result > 2 * n) return -1;
        if (not g.count(i)) {
            int j = g.begin()->first;
            int k = g.begin()->second.begin()->first;
            unlink(j, k);
            link(j, i);
            i = k;
        } else {
            int j = g[i].begin()->first;
            unlink(i, j);
            i = j;
        }
    }
    return result;
}

int main() {
    int n; scanf("%d", &n);
    vector<int> a(n); repeat (i, n) scanf("%d", &a[i]);
    vector<int> b(n); repeat (i, n) scanf("%d", &b[i]);
    int result = solve(n, a, b);
    printf("%d\n", result);
    return 0;
}

Submission Info

Submission Time
Task D - XOR Replace
User kimiyuki
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1445 Byte
Status WA
Exec Time 166 ms
Memory 15104 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int n; scanf("%d", &n);
                           ^
./Main.cpp:50:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     vector<int> a(n); repeat (i, n) scanf("%d", &a[i]);
                                                       ^
./Main.cpp:51:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     vector<int> b(n); repeat (i, n) scanf("%d", &b[i]);
                                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 4
AC × 48
WA × 26
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 20 ms 1024 KB
1_08.txt AC 82 ms 15104 KB
1_09.txt AC 106 ms 15104 KB
1_10.txt AC 23 ms 1024 KB
1_11.txt AC 42 ms 1024 KB
1_12.txt AC 23 ms 1024 KB
1_13.txt AC 23 ms 1024 KB
1_14.txt WA 29 ms 1024 KB
1_15.txt AC 48 ms 1024 KB
1_16.txt WA 30 ms 1024 KB
1_17.txt AC 40 ms 1024 KB
1_18.txt AC 33 ms 1024 KB
1_19.txt AC 52 ms 1024 KB
1_20.txt AC 33 ms 1024 KB
1_21.txt AC 51 ms 1024 KB
1_22.txt WA 47 ms 1792 KB
1_23.txt AC 69 ms 1792 KB
1_24.txt WA 47 ms 1792 KB
1_25.txt AC 66 ms 1792 KB
1_26.txt WA 83 ms 4864 KB
1_27.txt AC 101 ms 4864 KB
1_28.txt WA 85 ms 4864 KB
1_29.txt AC 103 ms 4992 KB
1_30.txt WA 99 ms 5760 KB
1_31.txt AC 119 ms 5760 KB
1_32.txt WA 101 ms 5760 KB
1_33.txt AC 107 ms 5888 KB
1_34.txt WA 108 ms 6272 KB
1_35.txt AC 123 ms 6528 KB
1_36.txt WA 106 ms 6272 KB
1_37.txt AC 128 ms 6400 KB
1_38.txt WA 125 ms 8576 KB
1_39.txt AC 144 ms 8576 KB
1_40.txt WA 123 ms 8576 KB
1_41.txt AC 132 ms 8576 KB
1_42.txt WA 145 ms 12032 KB
1_43.txt AC 144 ms 12288 KB
1_44.txt WA 140 ms 12288 KB
1_45.txt AC 136 ms 12160 KB
1_46.txt WA 147 ms 14208 KB
1_47.txt AC 131 ms 14080 KB
1_48.txt WA 148 ms 14208 KB
1_49.txt AC 147 ms 14080 KB
1_50.txt WA 148 ms 14720 KB
1_51.txt AC 161 ms 14336 KB
1_52.txt WA 155 ms 14848 KB
1_53.txt AC 134 ms 14720 KB
1_54.txt WA 148 ms 14848 KB
1_55.txt AC 162 ms 14592 KB
1_56.txt WA 150 ms 14976 KB
1_57.txt AC 128 ms 14976 KB
1_58.txt WA 154 ms 14976 KB
1_59.txt AC 164 ms 14976 KB
1_60.txt WA 149 ms 14976 KB
1_61.txt AC 122 ms 14976 KB
1_62.txt WA 150 ms 15104 KB
1_63.txt AC 129 ms 14336 KB
1_64.txt WA 146 ms 14848 KB
1_65.txt AC 160 ms 14848 KB
1_66.txt WA 148 ms 14848 KB
1_67.txt AC 166 ms 14848 KB
1_68.txt WA 149 ms 14976 KB
1_69.txt AC 161 ms 14976 KB