Submission #1000806

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000806		Boycl07	Magic Show (APIO24_show)	C++17	0 / 100	1 ms	344 KiB

Alice

#include "Alice.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define rep(i, n) for(int i = 1; (i) <= (n); ++i)
#define forn(i, l, r) for(int i = (l); i <= (r); ++i)
#define ford(i, r, l) for(int i = (r); i >= (l); --i)
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define FORD(i, n) for(int i = ((n) - 1); i >= 0; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "note"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)
 
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
 
inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}
 
const int MaxN = 5000;
const int MaxM = 6;
 
int p[MaxN + 33];
int cnt[MaxN];
 
vector<std::pair<int, int>> Alice()
{
    int n = MaxN;
    mt19937 rng(129322);
    rep(i, n) p[i] = i;
    shuffle(p + 1, p + 1 + n, rng);
 
    ll target = setN(MaxN);
 
    forn(i, 0, 59) cnt[i] = 0;
    vector<int> bits;
    forn(i, 0, 59) if(target >> i & 1)
        bits.pb(i);
    vector<pii> res;
  	res.clear();
    forn(i, 2, n - 1)
    {
        pii Min = {1e9, 0};
        for(int x : bits)
            minimize(Min, {cnt[x], x});
        if(i <= Min.se) res.pb({p[i], p[n]});
        else res.pb({p[i], p[i - Min.se]});
    }
    return res;
}

Bob

#include "Bob.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
#define rep(i, n) for(int i = 1; (i) <= (n); ++i)
#define forn(i, l, r) for(int i = (l); i <= (r); ++i)
#define ford(i, r, l) for(int i = (r); i >= (l); --i)
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define FORD(i, n) for(int i = ((n) - 1); i >= 0; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define endl "\n"
#define task "note"
#define sz(a) int(a.size())
#define C(x, y) make_pair(x, y)
#define all(a) (a).begin(), (a).end()
#define bit(i, mask) (mask >> i & 1)
 
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
 
inline int readInt()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();int n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline ll readLong()       {char c;while(c=getchar(),c!='-'&&(c<'0'||c>'9'));bool sign=(c=='-');if(sign)c=getchar();ll  n=c-'0';while(c=getchar(),c>='0'&&c<='9')n=10*n+c-'0';return(!sign)?n:-n;}
inline string readString() {char c;while(c=getchar(),c==' '||c=='\n'||c=='\t');string s({c});while(c=getchar(),c!=EOF&&c!=' '&&c!='\n'&&c!='\t')s+=c;return s;}
 
const int MaxN = 5000;
const int MaxM = 6;
 
int p[MaxN + 33];
int cnt[MaxN];
long long Bob(std::vector<std::pair<int, int>> V)
{
 
    int n = MaxN;
    mt19937 rng(129322);
    rep(i, n) p[i] = i;
    shuffle(p + 1, p + 1 + n, rng);
 
 
    ll res = 0;
    for(auto &[u, v] : V)
    {
        if(p[u] > p[v]) swap(u, v);
        if(p[v] - p[u] > 59) continue;
        res |= 1ll << (p[v] - p[u]);
    }
    return res;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 30
• Subtask 3: 0 / 65