# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006187 | m5588ohammed | Data Transfer (IOI19_transfer) | C++14 | 6 ms | 5656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector<int> get_attachment(vector <int> source) {
int cnt=0,sum=0,k;
for(int i=1;i<=source.size();i++){
if(source[i-1]==1){
sum++;
cnt^=i;
}
}
vector <int> ans=source;
k=sum%2;
while(cnt!=0){
ans.push_back(cnt%2);
cnt/=2;
}
ans.push_back(k);
return ans;
}
vector<int> retrieve(vector<int> data) {
int cnt=0,sum=0,k=data[data.size()-1],num=0;
int n = (data.size() > 255 ? 255 : 63);
for(int i=1;i<=n;i++){
if(data[i-1]==1){
sum++;
cnt^=i;
}
}
for(int i=n+1;i<data.size();i++) num+=data[i-1]*(1<<(i-n));
if(sum%2!=k&&cnt!=num) data[(cnt^num)-1]^=1;
vector <int> ans;
for(int i=0;i<n;i++) ans.push_back(data[i]);
return ans;
}
// int main(){
// char c;
// vector <int> ans;
// for(int i=0;i<63;i++){
// cin>>c;
// if(c=='1') ans.push_back(1);
// else ans.push_back(0);
// }
// ans=get_attachment(ans);
// for(int i:ans) cout<<i<<" ";
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |