| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1310676 | matere | Data Transfer (IOI19_transfer) | C++20 | 52 ms | 1728 KiB |
#include "transfer.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> get_attachment(vector<int> source) {
int N=source.size();
int num=0;
for(int i=0;i<N;i++){
if(source[i]==1) num^=(i+1);
}
vector<int>v;
if(N==63){
int fn=0;
for(int i=0;i<6;i++){
if((1<<i)&num){
v.push_back(1);
fn^=1;
}
else{
v.push_back(0);
}
}
v.push_back(fn);
return v;
}
else if(N==255){
int fn=0;
for(int i=0;i<8;i++){
if((1<<i)&num){
v.push_back(1);
fn^=1;
}
else{
v.push_back(0);
}
}
v.push_back(fn);
return v;
}
assert(0);
}
vector<int> retrieve(vector<int> data) {
int N=data.size();
if(N==63+7){
vector<int>source = vector<int>(data.begin(), data.end()-7);
vector<int>xtra = vector<int>(data.end()-7, data.end()-1);
int fn=data.back();
int num=0,num2=0;
for(int i=0;i<N-7;i++){
if(source[i]==1) num^=(i+1);
}
vector<int>v;
int fn2=0;
for(int i=0;i<6;i++){
if(xtra[i]==1){
num2+=(1<<i);
fn2^=1;
}
}
// cout<<num<<' '<<num2<<' '<<fn<<' '<<fn2<<' '<<(num2^num)<<endl;
if(fn!=fn2) return source;
if(num==num2) return source;
source[(num2^num)-1]^=1;
return source;
}
else if(N==255+9){
vector<int>source = vector<int>(data.begin(), data.end()-9);
vector<int>xtra = vector<int>(data.end()-9, data.end()-1);
int fn=data.back();
int num=0,num2=0;
for(int i=0;i<N-9;i++){
if(source[i]==1) num^=(i+1);
}
vector<int>v;
int fn2=0;
for(int i=0;i<8;i++){
if(xtra[i]==1){
num2+=(1<<i);
fn2^=1;
}
}
if(fn!=fn2) return source;
if(num==num2) return source;
source[(num2^num)-1]^=1;
return source;
}
assert(0);
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
