Submission #1308914

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308914		minh30082008	Data Transfer (IOI19_transfer)	C++20	0 / 100	7 ms	3252 KiB

transfer

#include "transfer.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, k, n) for(int i = k; i <= n; i++)
#define FOR1(i, k, n) for(int i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "ALONE.inp"
#define output "ALONE.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e4 + 5;
const int mod = 1e9 + 7;
const int base = 998244353;
const int base1 = 31;
const int SZ = 320;
const ll INF = 1e18;
void add(int &a, int b) 
{
	a += b; 
	if(a >= mod) a -= mod; 
	if(a < 0) a += mod; 
}
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r)
{
	return uniform_int_distribution<int>(l, r) (rd);
}

vi get_attachment(vi source) {
	int n = source.size();
	int T = 0;
	FOR(i, 0, n - 1)
		if(source[i] == 1)
			T ^= (i + 1);
	vi ans = source;
	if(n == 63)
	{
		int dem = 0;
		FOR(i, 0, 5)
		{
			ans.pb((T >> i) & 1);
			dem += ((T >> i) & 1);
		}
		dem %= 2;
		ans.pb(dem);
	}
	else
	{
		int dem = 0;
		FOR(i, 0, 7)
		{
			ans.pb((T >> i) & 1);
			dem += ((T >> i) & 1);
		}
		dem %= 2;
		ans.pb(dem);
	}
	return ans;
}
vi retrieve(vi data) {
	vi ans;
	int n = data.size();
	int k;
	if(n <= 200)
		k = 5;
	else
		k = 7;
	FOR(i, 0, n - 3 - k)
		ans.pb(data[i]);
	int chanle = data.back();
	vi sua;
	int dem = 0;
	FOR(i, n - 2 - k, n - 2)
	{
		sua.pb(data[i]);
		dem += data[i];
	}
	dem %= 2;
	if(dem != chanle)
	{
		return ans;
	}
	int res = 0;
	FOR(i, 0, sua.size() - 1)
		res += (sua[i] << i);
	int T = 0;
	FOR(i, 0, ans.size() - 1)
		if(ans[i])
			T ^= (i + 1);
	T ^= res;
	if(T)
	{
		ans[T - 1] = 1 - ans[T - 1];
	}
	return ans;
}

Compilation message (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: 0 / 60
• Subtask 2: 0 / 40