제출 #1363780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1363780		nerrrmin	Data Transfer (IOI19_transfer)	C++20	0 / 100	5 ms	3256 KiB

transfer

#include "transfer.h"
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
int n, k;
std::vector < int > v;
int get_xor(int bit, vector < int > v)
{
	int res = 0;
	for (int i = 0; i < n; ++ i)
	{
		int has = ((1 << bit) & i);
		if(has)res = (res ^ v[i]);
	} 
	return res;
}
std::vector<int> get_attachment(std::vector<int> source) {
	v = source;
	std::vector<int> res = source;
	n = (int)source.size();
	if(n == 63)k = 6;
	else k = 8;
	
	for (int bit = 0; bit < 6; ++ bit)
	{
		int x = get_xor(bit, v);
		res.pb(x);
	}
	int total = 0;
	for (int i = 0; i < n; ++ i)
		total = (total ^ v[i]);
	res.pb(total);
	return res;
}

std::vector<int> retrieve(std::vector<int> data)
{
	vector < int > ans;
	int sz = data.size();
	if(sz == 255 + 9)n = 255;
	else n = 63;
	
	int total = 0;
	for (int i = 0; i < n; ++ i)
	{
		ans.pb(data[i]);
		total = (total ^ data[i]);
	}
	if(n == 255)k = 8;
	else k = 6;
	if(data.back() == total)return ans;
	
	int problem = 0, j = n;
	for (int bit = 0; bit < k; ++ bit)
	{
		int last = data[j];
		int curr = get_xor(bit, ans);
		if(last != curr)
		{
			problem += (1 << bit);
		}
		j ++;
	}
	ans[problem] = 1 - ans[problem];
	return ans;
}

컴파일 시 표준 에러 (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)
      |     ^~~~~~~~~~~~~~

• 서브태스크 1: 0 / 60
• 서브태스크 2: 0 / 40