| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344647 | killerzaluu | Data Transfer (IOI19_transfer) | C++20 | 128 ms | 1724 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> get_attachment(vector<int> source) {
int n = source.size();
int k = 0;
int sad = 0;
while (sad < n) {
sad = sad * 2 + 1;
k++;
}
vector<int> ans(k + 1, 0);
for (int i = 1; i <= n; i++) {
int temp = i;
int cnt = 0;
while (temp > 0) {
if (temp % 2 == 1) ans[cnt] ^= source[i - 1];
temp /= 2;
cnt++;
}
ans[k] ^= source[i - 1];
}
return ans;
}
vector<int> retrieve(vector<int> data) {
int sz = data.size();
int n = -1, k = -1;
for (int i = 0; i <= 20; i++) {
int tempn = (1 << i) - 1;
if (tempn + i + 1 == sz) {
n = tempn;
k = i;
break;
}
}
vector<int> a(n + 1), bad(k + 1), now(k + 1, 0);
for (int i = 1; i <= n; i++) a[i] = data[i - 1];
for (int i = 0; i <= k; i++) bad[i] = data[n + i];
for (int i = 1; i <= n; i++) {
int temp = i;
int cnt = 0;
while (temp > 0) {
if (temp % 2 == 1) now[cnt] ^= a[i];
temp /= 2;
cnt++;
}
now[k] ^= a[i];
}
int sum = 0;
for (int i = 0; i < k; i++) {
if (now[i] != bad[i]) sum += (1 << i);
}
if (now[k] != bad[k]) {
if (sum != 0) a[sum] ^= 1;
}
vector<int> ans;
for (int i = 1; i <= n; i++) ans.push_back(a[i]);
return ans;
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
