Submission #1310872

#TimeUsernameProblemLanguageResultExecution timeMemory
1310872aleksandreData Transfer (IOI19_transfer)C++20
0 / 100
7 ms3252 KiB
#include "transfer.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> get_attachment(std::vector<int> source) {
	vector <int> ans;
	ans = source;
	int n = source.size();
	while (n > 1) {
		int cnt = 0;
		n /= 2;
		for (int i = 0; i < n; i++) {
			if (source[i] == 1) cnt++;
		}
		if (cnt%2) ans.push_back(1);
		else ans.push_back(0);
	}
	int cnt = 0;
	for (int i = 0; i < ans.size(); i++) {
		if (ans[i] == 1) cnt++;
	}
	if (cnt%2) ans.push_back(1);
	else ans.push_back(0);
	return ans;
}
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));
			}
			if (res != 0) {
				data[res-1] = 1 - data[res-1];
			}
		}
		vector <int> ans;
		for (int i = 0; i < 63; i++) {
			ans.push_back(data[i]);
		}
		return ans;
	}
	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));
			}
			if (res != 0) {
				data[res-1] = 1 - data[res-1];
			}
		}
		vector <int> ans;
		for (int i = 0; i < 255; i++) {
			ans.push_back(data[i]);
		}
		return ans;
	}
}

Compilation message (stderr)

transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
   65 | }
      | ^
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)
      |     ^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...