| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1310783 | nikaa123 | Data Transfer (IOI19_transfer) | C++20 | 5 ms | 1720 KiB |
#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();
int sum = 0; for (auto x:data) sum+= x;
if (sum == 1) {
if (n == 70) {
return vector <int> (63,0);
} else {
return vector <int> (255,0);
}
}
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;
}
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
