Submission #728102

#	Time	Username	Problem	Language	Result	Execution time	Memory
728102		sunwukong123	Super Dango Maker (JOI22_dango3)	C++17	7 / 100	4139 ms	1000 KiB

dango3

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

#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = -1;
vector<int> lft;
int n,m;
int Query_max(vector<int> vec) {
    bool have[n*m+5];
    memset(have,0,sizeof have);
    for(auto i:vec)have[i]=1;
    vector<int> qq;
    FOR(i,1,n*m){
        if(have[i]==0)qq.pb(i);
    }
    int res = Query(qq);
    return m-res;
}
vector<int> V[30];
void Solve(int n, int m) {
    ::n=n;
    ::m=m;
    vector<int> vec;
    FOR(i,1,n*m)vec.pb(i); 

    FOR(i,1,n) {
        vector<int> out;
        vector<int> nvec;
        out.pb(vec.back());
        vec.pop_back();
        shuffle(all(vec),rng);
        int sz=1;
        while(vec.size()) {
            vector<int> qq;
            FOR(i,1,sz) {
                if(vec.size()) {
                    int x=vec.back(); vec.pop_back();
                    qq.pb(x);
                }
            }
            vector<int> thisquery; 
            for(auto i:out)thisquery.pb(i);
            for(auto i:qq)thisquery.pb(i);
            int res=Query_max(thisquery);
            if(res == sz){
                for(auto i:qq)nvec.pb(i);
                continue;
            }

            for(auto i:qq) {
                thisquery.clear();
                for(auto i:out)thisquery.pb(i);
                thisquery.pb(i);
                int res=Query_max(thisquery);
                if(res==sz){
                    nvec.pb(i);
                    continue;
                }
                else {
                    ++sz;
                    out.pb(i);
                }
            }
        }
        FOR(i,0,m-1) {
            V[i].pb(out[i]);
        }
        vec=nvec;
    }
    FOR(i,0,m-1){
        Answer(V[i]);
    }
}

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