Submission #1308930

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308930		ojuz_user	Data Transfer (IOI19_transfer)	C++20	0 / 100	6 ms	1724 KiB

transfer

#include "transfer.h"
#include <bits/stdc++.h>
using namespace std;

#define file "o"
#define ff(i, a, b) for(auto i=(a); i<=(b); ++i)
#define ffr(i, b, a) for(auto i=(b); i>=(a); --i)
#define nl "\n"
#define ss " "
#define pb emplace_back
#define fi first
#define se second
#define sz(s) (int)s.size()
#define all(s) (s).begin(), (s).end()
#define ms(a,x) memset(a, x, sizeof (a))
#define cn continue
#define re exit(0)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline ll ran(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rng);
}

inline void rf()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    if(fopen(file".inp","r"))
    {
        freopen(file".inp","r",stdin);
        freopen(file".out","w",stdout);
    }
}

const int mod=998244353;
const int maxn=2e5+15;
const ll inf=1e18;

template<typename T> inline void add(T &x, const T &y)
{
    x+=y;
    if(x>=mod) x-=mod;
    if(x<0) x+=mod;
}

template<typename T> inline bool maxi(T &a, T b)
{
    if(a>=b) return 0;
    a=b; return 1;
}

template<typename T> inline bool mini(T &a, T b)
{
    if(a<=b) return 0;
    a=b; return 1;
}

vi get_attachment(vi source)
{
    int n=sz(source), k;
    if(n==63) k=7;
    else k=9;
    int totxor=0;
    ff(i, 0, n-1) if(source[i]==1) totxor^=(i+1);
    vi v;
    int cnt=0;
    ff(i, 0, k-2)
    {
        if((totxor>>i)&1) ++cnt, v.pb(1);
        else v.pb(0);
    }
    v.pb(cnt%2);
    return v;
}

vi retrieve(vi data)
{
    int n=sz(data), k;
    if(n==70) k=7;
    else k=9;
    n-=k;
    int totxor=0, cnt=0;
    ff(i, n, n+k-2) if(data[i]==1) totxor|=(1<<(i-n+1)), ++cnt;
    vi ans;
    ff(i, 0, n-1) ans.pb(data[i]);
    if((cnt%2)!=data.back() || totxor==0) return ans;
    else
    {
        int pos=totxor;
        ff(i, 0, n-1) if(ans[i]==1) pos^=i;
        if(pos) ans[pos-1]=1-ans[pos-1];
        return ans;
    }
}

Compilation message (stderr)

grader.cpp: In instantiation of 'void shuffle(std::vector<T>&) [with T = Scenario]':
grader.cpp:200:10:   required from here
grader.cpp:28:23: warning: 'void std::random_shuffle(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<Scenario*, vector<Scenario> >]' is deprecated: use 'std::shuffle' instead [-Wdeprecated-declarations]
   28 |         random_shuffle(v.begin(), v.end());
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from grader.cpp:8:
/usr/include/c++/13/bits/stl_algo.h:4581:5: note: declared here
 4581 |     random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~~~~~~~~~~~

• Subtask 1: 0 / 60
• Subtask 2: 0 / 40