oj.uz

Submission #770932

# Submission time Handle Problem Language Result Execution time Memory
770932 2023-07-02T07:11:30 Z rxlfd314 Data Transfer (IOI19_transfer) C++17
0 / 100
 5 ms 2488 KB 
#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;

void yeet(int n, vector<int> &v, vector<int> &source) {
	for (int j = 0; (1 << j) <= n; j++) {
		v.push_back(0);
		for (int i = 1; i <= n; i++) {
			if (i & 1 << j) {
				v[j] ^= source[i-1];
			}
		}
	}
}

vector<int> get_attachment(vector<int> source) {
	int N = source.size();
	vector<int> ret;
	yeet(N, ret, source);
	ret.push_back(0);
	for (int i = 0; i < N; i++) {
		ret.back() ^= source[i];
	}
	return ret;
}

vector<int> retrieve(vector<int> data) {
	int N = data.size() < 255 ? 63 : 255;
	int M = data.size();
	vector<int> test;
	yeet(N, test, data);
	if (test == vector<int>(data.begin()+N, data.begin()+M-1)) {
		return vector<int>(data.begin(), data.begin()+N);
	}
	bool p = 0;
	for (int i = 0; i < N; i++) {
		p ^= data[i];
	}
	if (p ^ data[M-1]) {
		for (int i = 1; i <= N; i++) {
			for (int j = 0; (1 << j) <= N; j++) {
				if (i & 1 << j) {
					test[j] ^= 1;
				}
			}
			if (test == vector<int>(data.begin()+N, data.begin()+M-1)) {
				return vector<int>(data.begin(), data.begin()+N);
			}
			for (int j = 0; (1 << j) <= N; j++) {
				if (i & 1 << j) {
					test[j] ^= 1;
				}
			}
		}
	}
	return vector<int>(data.begin(), data.begin()+N);
}

Subtask #1
0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 644 KB WA in grader: wrong source retrieval
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2488 KB WA in grader: wrong source retrieval
2 Halted 0 ms 0 KB -