Submission #1059915

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1059915	2024-08-15T09:09:31 Z	thieunguyenhuy	Data Transfer (IOI19_transfer)	C++17	0 / 100	2 ms	1208 KB

transfer

#ifndef hwe
    #include "transfer.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

vector<int> get_attachment(vector<int> _source) {
    vector<int> source = _source;
    assert(source.size() == 63);
    int Xor = 0, lim = 6;
    for (auto &x : source) Xor ^= x;
    source.emplace_back(Xor);
    // for (int i = 0; i < 64 - 1; ++i) source.emplace_back(source[i]);
    for (int bit = 0; bit < lim; ++bit) {
        int cur_xor = 0;
        for (int i = 0; i < 64; ++i) if (BIT(i, bit)) cur_xor ^= source[i];
        source.emplace_back(cur_xor);
    }
    return source;
}

vector<int> retrieve(vector<int> _data) {
    vector<int> data = _data;
    int Xor = 0, lim = 6;
    for (int i = 0; i < 64; ++i) Xor ^= data[i];
    if (Xor != 0) {
        // return vector<int>(data.begin() + 64, data.end());
        int wrong_spot = 0;
        for (int bit = 0; bit < lim; ++bit) {
            int cur_xor = 0;
            for (int i = 0; i < 64; ++i) if (BIT(i, bit)) cur_xor ^= data[i];
            assert(bit + 54 < data.size());
            if (cur_xor != data[bit + 64]) wrong_spot |= MASK(bit);
        }
        data[wrong_spot] = !data[wrong_spot];
    }

    vector<int> ans;
    for (int i = 0; i < 63; ++i) ans.emplace_back(data[i]);
    return ans;
}

#ifdef hwe
signed main() {
    vector<vector<int>> sources;
    vector<pair<vector<int>, int>> datas;

    for (int _ = 0; _ < 100; ++_) {
        // int n; cin >> n;
        int LOG = 6, n = MASK(LOG) - 1;
        vector<int> source(n);
        for (auto &x : source) x = random(2);
        vector<int> data = get_attachment(source);
        int corruption = random(data.size());
        data[corruption] = !data[corruption];
        datas.emplace_back(data, _), sources.emplace_back(source);
        // for (auto &x : data) cerr << x << ' ';
        // cerr << '\n';
    }

    shuffle(datas.begin(), datas.end(), rng);

    for (int _ = 0; _ < 100; ++_) {
        vector<int> retrival = retrieve(datas[_].first);
        assert(retrival == sources[datas[_].second]);
    }

    cerr << '\n'; return 0;
}
#endif

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from transfer.cpp:5:
transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:57:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             assert(bit + 54 < data.size());
      |                    ~~~~~~~~~^~~~~~~~~~~~~

Subtask #1

0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	1208 KB	WA in grader: wrong source retrieval
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	1116 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-