Submission #550649

#	Time	Username	Problem	Language	Result	Execution time	Memory
550649		BalintR	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	1770 ms	524 KiB

dango3

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

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound((v).begin(), (v).end(), x) - (v).begin())
#define ubv(v, x) (upper_bound((v).begin(), (v).end(), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cout << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cout << #arr; FR(i, n) cout << ' ' << arr[i]; cout << endl;}

mt19937_64 rng(95835673554);
ll randInt(ll a, ll b){
    return uniform_int_distribution(a, b)(rng);
}

void Solve(int n, int m){
    //cerr << "solve" << endl;
    vi rem;
    FR(i, n*m) rem.pb(i+1);

    while(m--){
        shuffle(ALL(rem), rng);
        vi vec;

        FORR(i, SZ(rem)-1, 0){
            if(SZ(vec) == n) break;
            int a = rem[i];
            rem.erase(rem.begin() + i);
            int qRes = Query(rem);
            if(qRes == m) vec.pb(a);
            else rem.pb(a);
        }

        //dbgArr(vec.begin(), n);
        Answer(vec);
    }
}

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 78 / 78