| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308929 | nguyenletrung | Data Transfer (IOI19_transfer) | C++20 | 5 ms | 1720 KiB |
#include<bits/stdc++.h>
#include "transfer.h"
#define ll long long
#define fi first
#define se second
#define ins insert
#define pb push_back
#define foru(i,a,b) for(int i=a;i<=b;i++)
#define ford(i,a,b) for(int i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
//#define int ll
using namespace std;
std::vector<int> get_attachment(std::vector<int> a) {
int x=0;
int n=a.size(),cl=0;
for(int i=0;i<=n-1;i++)
{
if(a[i]==1)
{
x=x^a[i];
cl=cl^1;
}
}
int k=0;
if(n==63) k=6;
else k=8;
vector<int> ans;
for(int i=0;i<k;i++) ans.pb((x>>(i))&1);
ans.pb(cl);
return ans;
// return { 0, 1, 0 };
}
std::vector<int> retrieve(std::vector<int> data)
{
int sz=data.size();
int A=0,B=0;
if(sz<80) A=63,B=6;
else A=255,B=8;
int x=0,cl=0;
vector<int> ans;
for(int i=0;i<=A;i++)
{
ans.pb(data[i]);
if(data[i]==1)
{
x=x^i;
cl^=1;
}
}
if(cl==data[sz-1])
{
return ans;
}
else
{
int y=0;
for(int i=A+1;i<=A+B;i++)
{
if(data[i]==1)
{
y+=(1<<(i-A-1));
}
}
if(x==y) return ans;
else
{
int z=x^y;
ans[z]=ans[z]^1;
return ans;
}
}
}
//signed main()
//{
// ios_base::sync_with_stdio(0);
// cin.tie(0);cout.tie(0);
//// freopen(".inp","r",stdin);
//// freopen(".out","w",stdout);
//}
/*
em thi cho du co khoc
cung se den ngay phai quen
thien duong van cho ngay em den
*/
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
