oj.uz

Submission #543675

# Submission time Handle Problem Language Result Execution time Memory
543675 2022-03-31T08:15:31 Z Sho10 Data Transfer (IOI19_transfer) C++17
100 / 100
 105 ms 2496 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=1000000007;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
vector<int> get_attachment(vector<int>source){
ll xr=0,cnt=0;
for(ll i=0;i<source.size();i++)
{
    if(source[i]==1){
        xr^=(i+1);
        cnt++;
    }
}
vector<int>g;
g.pb(cnt%2);
if(source.size()==255){
for(int i=0;i<=7;i++)
{
if((1ll<<i)&xr){
    g.pb(1);
}else g.pb(0);
}
}else {
for(ll i=0;i<=5;i++)
{
    if((1ll<<i)&xr){
        g.pb(1);
    }else g.pb(0);
}
}
return g;
}
vector<int> retrieve(vector<int>data){

if(data.size()>=200){
    ll x=data[255];
    ll cnt=0;
    ll xr=0;
    for(ll i=0;i<255;i++)
    {
        if(data[i]==1){
            cnt++;
            xr^=(i+1);
        }
    }
    vector<int>res;
    if(cnt%2==x){
for(ll i=0;i<255;i++)
{
    res.pb(data[i]);
}
return res;
    }
    for(ll i=256;i<data.size();i++)
    {
        if(data[i]==1){
            xr^=(1ll<<(i-256));
        }
    }
if(xr==0){
    for(ll i=0;i<255;i++)
    {
        res.pb(data[i]);
    }
    return res;
}
for(ll i=0;i<255;i++)
{
    res.pb(data[i]);
}
res[xr-1]^=1;
return res;
}else {
ll x=data[63];
    ll cnt=0;
    ll xr=0;
    for(ll i=0;i<63;i++)
    {
        if(data[i]==1){
            cnt++;
            xr^=(i+1);
        }
    }
    vector<int>res;
    if(cnt%2==x){
for(ll i=0;i<63;i++)
{
    res.pb(data[i]);
}
return res;
    }
    for(ll i=64;i<data.size();i++)
    {
        if(data[i]==1){
            xr^=(1ll<<(i-64));
        }
    }
if(xr==0){
    for(ll i=0;i<63;i++)
    {
        res.pb(data[i]);
    }
    return res;
}
for(ll i=0;i<63;i++)
{
    res.pb(data[i]);
}
res[xr-1]^=1;
return res;
}
}
/*
int32_t main(){
CODE_START;
#ifdef LOCAL
    ifstream cin("input.txt");
#endif
*/

Compilation message

transfer.cpp: In function 'std::vector<int> get_attachment(std::vector<int>)':
transfer.cpp:20:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | for(ll i=0;i<source.size();i++)
      |            ~^~~~~~~~~~~~~~
transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:67:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(ll i=256;i<data.size();i++)
      |                  ~^~~~~~~~~~~~
transfer.cpp:105:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for(ll i=64;i<data.size();i++)
      |                 ~^~~~~~~~~~~~

Subtask #1
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 648 KB Output is correct
2 Correct 4 ms 644 KB Output is correct
3 Correct 3 ms 644 KB Output is correct
4 Correct 4 ms 652 KB Output is correct
5 Correct 4 ms 652 KB Output is correct
6 Correct 4 ms 648 KB Output is correct
7 Correct 4 ms 656 KB Output is correct
8 Correct 4 ms 732 KB Output is correct
9 Correct 4 ms 736 KB Output is correct
10 Correct 4 ms 644 KB Output is correct
11 Correct 3 ms 732 KB Output is correct
12 Correct 4 ms 648 KB Output is correct
13 Correct 4 ms 652 KB Output is correct
14 Correct 4 ms 644 KB Output is correct
15 Correct 3 ms 644 KB Output is correct
16 Correct 4 ms 644 KB Output is correct
17 Correct 4 ms 644 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 2484 KB Output is correct
2 Correct 81 ms 2492 KB Output is correct
3 Correct 80 ms 2488 KB Output is correct
4 Correct 84 ms 2492 KB Output is correct
5 Correct 93 ms 2488 KB Output is correct
6 Correct 99 ms 2484 KB Output is correct
7 Correct 83 ms 2484 KB Output is correct
8 Correct 82 ms 2484 KB Output is correct
9 Correct 74 ms 2484 KB Output is correct
10 Correct 81 ms 2484 KB Output is correct
11 Correct 72 ms 2492 KB Output is correct
12 Correct 77 ms 2484 KB Output is correct
13 Correct 80 ms 2484 KB Output is correct
14 Correct 78 ms 2412 KB Output is correct
15 Correct 105 ms 2436 KB Output is correct
16 Correct 84 ms 2496 KB Output is correct
17 Correct 82 ms 2496 KB Output is correct
18 Correct 80 ms 2496 KB Output is correct
19 Correct 76 ms 2484 KB Output is correct