# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006191 | AliMark71 | Data Transfer (IOI19_transfer) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "transfer.h"
using namespace std;
std::vector<int> get_attachment(std::vector<int> source) {
int xorSum = 0;
for (int i = 0; i < source.size(); i++) if (source[i]) xorSum ^= (i + 1);
int correctionSize = __builtin_popcount((int) source.size());
vector<int> correctionData(correctionSize + 1);
for (int i = 0; i < correctionSize; i++) if (xorSum&(1<<i)) correctionData[i] = 1;
correctionData.back() = __builtin_popcount(xorSum) % 2;
return correctionData;
}
std::vector<int> retrieve(std::vector<int> data) {
int baseSize = (data.size() == 70 ? 6 : 8);
vector<int> possibleSource(data.begin(), data.begin() + (1<<baseSize) - 1);
vector<int> correctionData(data.begin() + possibleSource.size(), data.end());
if (count(correctionData.begin(), correctionData.end() - 1, 1) % 2 == correctionData.back()) {
int checkSum = 0;
for (int i = 0, val = 1; i < correctionData.size() - 1; i++, val *= 2) checkSum += correctionData[i] * val;
int expectedCheckSum = 0;
for (int i = 0; i < possibleSource.size(); i++) if (possibleSource[i]) expectedCheckSum ^= (i + 1);
if (checkSum != expectedCheckSum) {
int errorPos = checkSum ^ expectedCheckSum;
possibleSource[errorPos - 1] ^= 1;
}
}
return possibleSource;
}