| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332198 | andreim | Data Transfer (IOI19_transfer) | C++20 | 129 ms | 1724 KiB |
#include "transfer.h"
#include <iostream>
using namespace std;
vector<int> get_attachment(vector<int> source)
{
int N_source = (int)source.size();
int r = 0;
while (((1 << r) - 1) < N_source + r)
r++;
vector<int> dataCols;
int limit = (1 << r);
for (int v = 1; v < limit && (int)dataCols.size() < N_source; v++)
{
if ((v & (v - 1)) == 0) continue;
dataCols.push_back(v);
}
int xorRes = 0;
for (int i = 0; i < N_source; i++)
if (source[i] == 1)
xorRes ^= dataCols[i];
vector<int> res;
for (int j = 0; j < r; j++)
res.push_back((xorRes >> j) & 1);
return res;
}
vector<int> retrieve(vector<int> data)
{
int N = (int)data.size();
int r = 0;
while ((1 << r) - 1 < N)
r++;
int N_source = N - r;
vector<int> dataCols;
int limit = (1 << r);
for (int v = 1; v < limit && (int)dataCols.size() < N_source; v++)
{
if ((v & (v - 1)) == 0) continue;
dataCols.push_back(v);
}
int syndrome = 0;
for (int i = 0; i < N_source; i++)
if (data[i] == 1)
syndrome ^= dataCols[i];
for (int j = 0; j < r; j++)
if (data[N_source + j] == 1)
syndrome ^= (1 << j);
if (syndrome != 0)
{
for (int i = 0; i < N_source; i++)
{
if (dataCols[i] == syndrome)
{
data[i] = (data[i] + 1) % 2;
break;
}
}
}
vector<int> res;
for (int i = 0; i < N_source; i++)
res.push_back(data[i]);
return res;
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
