oj.uz

답안 #1058665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1058665 2024-08-14T11:56:09 Z thieunguyenhuy Data Transfer (IOI19_transfer) C++17
0 / 100
 2 ms 1292 KB 
#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))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

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;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

vector<int> get_attachment(vector<int> _source) {
    vector<int> source = _source;
    int Xor = 0, lim = lg(source.size() + 1);
    for (auto &x : source) Xor ^= x;
    source.emplace_back(Xor);
    for (int i = 0; i < MASK(lim) - 1; ++i) source.emplace_back(source[i]);
    // for (int bit = 0; bit < lim; ++bit) {
    //     int cur_xor = 0;
    //     for (int i = 0; i < MASK(lim); ++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 = lg(data.size());
    for (int i = 0; i < MASK(lim); ++i) Xor ^= data[i];
    if (Xor != 0) {
        return vector<int>(data.begin() + MASK(lim), data.end());
        // int wrong_spot = 0;
        // for (int bit = 0; bit < lim; ++bit) {
        //     int cur_xor = 0;
        //     for (int i = 0; i < MASK(lim); ++i) if (BIT(i, bit)) cur_xor ^= data[i];
        //     if (cur_xor != data[bit + MASK(lim)]) wrong_spot = ON(wrong_spot, bit);
        // }
        // data[wrong_spot] = !data[wrong_spot];
    }
    return vector<int>(data.begin(), data.begin() + MASK(lim) - 1);
}

#ifdef hwe
signed main() {
    for (int _ = 0; _ < 1; ++_) {
        int n; cin >> n;
        // int LOG = random(3, 7), 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];
        vector<int> retrival = retrieve(data);
        for (auto &x : data) cerr << x << ' ';
        cerr << '\n';
        if (retrival == source) cerr << "Accepted\n";
        else {
            cerr << "Wrong answer\n";
            return 0;
        }
    }

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

Subtask #1
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1036 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 1292 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -