oj.uz

Submission #1115690

# Submission time Handle Problem Language Result Execution time Memory
1115690 2024-11-20T19:21:31 Z Tymond Data Transfer (IOI19_transfer) C++17
100 / 100
 33 ms 2828 KB 
#include <bits/stdc++.h>
#include "transfer.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

vi get_attachment(vi source){
    int k = 0;
    for(int i = 0; i < sz(source); i++){
        if(source[i]){
            k ^= (i + 1);
        }
    }

    vi res;
    for(int i = 0; i <= 10; i++){
        if(sz(source) == 63 && (1 << i) >= (1 << 6)){
            continue;
        }

        if(sz(source) > 63 && (1 << i) >= (1 << 8)){
            continue;
        }

        if((1 << i) & k){
            res.pb(1);
        }else{
            res.pb(0);
        }
    }

    res.pb((__builtin_popcount(k) & 1));
    return res;
}

vi retrieve(vi data){
    int l = data.back();
    data.pop_back();

    int k = 0;
    if(sz(data) <= 80){
        for(int i = 0; i < 6; i++){
            k *= 2;
            k += data.back();
            data.pop_back();
        }
    }else{
        for(int i = 0; i < 8; i++){
            k *= 2;
            k += data.back();
            data.pop_back();
        }
    }

    if((__builtin_popcount(k) & 1) != l){
        return data;
    }

    for(int i = 0; i < sz(data); i++){
        if(data[i]){
            k ^= (i + 1);
        }
    }

    if(0 == k){
        return data;
    }

    data[k - 1] = 1- data[k - 1];
    return data;
}

Subtask #1
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 776 KB Output is correct
2 Correct 2 ms 772 KB Output is correct
3 Correct 2 ms 944 KB Output is correct
4 Correct 2 ms 772 KB Output is correct
5 Correct 3 ms 772 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 772 KB Output is correct
8 Correct 2 ms 772 KB Output is correct
9 Correct 2 ms 776 KB Output is correct
10 Correct 3 ms 772 KB Output is correct
11 Correct 2 ms 772 KB Output is correct
12 Correct 2 ms 784 KB Output is correct
13 Correct 2 ms 772 KB Output is correct
14 Correct 2 ms 776 KB Output is correct
15 Correct 3 ms 784 KB Output is correct
16 Correct 2 ms 772 KB Output is correct
17 Correct 2 ms 772 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2672 KB Output is correct
2 Correct 33 ms 2488 KB Output is correct
3 Correct 28 ms 2488 KB Output is correct
4 Correct 31 ms 2640 KB Output is correct
5 Correct 33 ms 2492 KB Output is correct
6 Correct 28 ms 2488 KB Output is correct
7 Correct 27 ms 2492 KB Output is correct
8 Correct 27 ms 2660 KB Output is correct
9 Correct 26 ms 2492 KB Output is correct
10 Correct 24 ms 2656 KB Output is correct
11 Correct 24 ms 2500 KB Output is correct
12 Correct 27 ms 2488 KB Output is correct
13 Correct 30 ms 2496 KB Output is correct
14 Correct 27 ms 2500 KB Output is correct
15 Correct 27 ms 2488 KB Output is correct
16 Correct 28 ms 2656 KB Output is correct
17 Correct 28 ms 2508 KB Output is correct
18 Correct 28 ms 2828 KB Output is correct
19 Correct 27 ms 2488 KB Output is correct