Submission #1310784

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310784		nikaa123	Data Transfer (IOI19_transfer)	C++20	0 / 100	5 ms	1720 KiB

transfer

#include <bits/stdc++.h>
#include "transfer.h"
using namespace std;

std::vector<int> get_attachment(std::vector<int> source) {
	int n = source.size();
	int res = 0;
	for (int i = 0; i < n; i++) {
		res ^= source[i]*(i+1);
	}
	if (n == 63) {
		vector <int> k(7,0);
		for (int i = 0; i < 6; i++) {
			if (res & (1<<i)) k[i] = 1;
		}
		k[6] = (__builtin_popcount(res)%2);
		return k;
	} else {
		vector <int> k(9,0);
		for (int i = 0; i < 8; i++) {
			if (res & (1<<i)) k[i] = 1;
		}
		k[8] = (__builtin_popcount(res)%2);
		return k;
	}
}

std::vector<int> retrieve(std::vector<int> data) {
	int n = data.size();

	if (n == 70) {
		int res = 0;
		for (int i = 0; i < 6; i++) {
			res |= (data[i+63] << i);
		}
		if ((__builtin_popcount(res) % 2) == data[69]) {
			for (int i = 0; i < 63; i++) {
				res ^= (data[i] * (i+1));
			}
		}
		vector <int> answer;
		for (int i = 0; i < 63; i++) {
			answer.push_back(data[i]);
		}
		return answer;
	}
	if (n == 264) {
		int res = 0;
		for (int i = 0; i < 8; i++) {
			res |= (data[i+255] << i);
		}
		if ((__builtin_popcount(res) % 2) == data[263]) {
			for (int i = 0; i < 255; i++) {
				res ^= (data[i] * (i+1));
			}
			res--;
			res = max(res,0);
			data[res] = 1 - data[res];
		}
		vector <int> answer;
		for (int i = 0; i < 255; i++) {
			answer.push_back(data[i]);
		}
		return answer;
	}

}

Compilation message (stderr)

transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^
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