제출 #1304242

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304242		PakinDioxide	Data Transfer (IOI19_transfer)	C++17	60 / 100	8 ms	1728 KiB

transfer

#include "transfer.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

vector<int> get_attachment(vector<int> a) {
    int n = a.size();
    vector <int> v;
    int it = 0;
    int b[257]; memset(b, 0, sizeof(b));
    for (int i = 0; (1 << i) <= 256; i++) b[(1 << i)] = 1;
    for (int i = 0; it < n; i++) {
        if (b[i+1]) v.emplace_back(0);
        else v.emplace_back(a[it++]);
    }
    vector <int> ans;
    for (int i = 0; (1 << i) <= v.size(); i++) {
        for (int j = 0; j < v.size(); j++) if ((j+1) & (1 << i)) v[(1<<i)-1] ^= v[j];
        ans.emplace_back(v[(1<<i)-1]);
    }
    return ans;
}

vector<int> retrieve(vector<int> v) {
    int cnt = 0;
    for (int i = 0; (1 << i) <= v.size(); i++) cnt++;
    vector <int> a, ks;
    for (int i = 0; i < (int) v.size()-cnt; i++) a.emplace_back(v[i]);
    for (int i = (int) v.size()-cnt; i < v.size(); i++) ks.emplace_back(v[i]);
    vector <int> V;
    int ia = 0, ik = 0;
    int b[257]; memset(b, 0, sizeof(b));
    for (int i = 0; (1 << i) <= 256; i++) b[(1 << i)] = 1;
    for (int i = 0; i < v.size(); i++) {
        if (b[i+1]) V.emplace_back(ks[ik++]);
        else V.emplace_back(a[ia++]);
    }
    swap(v, V);
    int k = 0;
    for (int i = 0; (1 << i) <= v.size(); i++) {
        int kk = 0;
        for (int j = 0; j < v.size(); j++) if ((j+1) & (1 << i)) kk ^= v[j];
        k |= (kk << i);
    }
    k--;
    if (k >= 0) v[k] ^= 1;
    a.clear();
    for (int i = 0; i < v.size(); i++) {
        if (!b[i+1]) a.emplace_back(v[i]);
    }
    return a;
}

컴파일 시 표준 에러 (stderr) 메시지

grader.cpp: In instantiation of 'void shuffle(std::vector<T>&) [with T = Scenario]':
grader.cpp:200:10:   required from here
grader.cpp:28:23: warning: 'void std::random_shuffle(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<Scenario*, vector<Scenario> >]' is deprecated: use 'std::shuffle' instead [-Wdeprecated-declarations]
   28 |         random_shuffle(v.begin(), v.end());
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from grader.cpp:8:
/usr/include/c++/13/bits/stl_algo.h:4581:5: note: declared here
 4581 |     random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~~~~~~~~~~~

• Subtask 1: 60 / 60
• Subtask 2: 0 / 40