Submission #892248

#	Time	Username	Problem	Language	Result	Execution time	Memory
892248		vjudge1	Super Dango Maker (JOI22_dango3)	C++17	22 / 100	211 ms	760 KiB

dango3

#include <bits/stdc++.h>

#include "dango3.h"

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

void Solve(int n, int m){
    vector <int> p, us(n * m + 1);
    for ( int i = 1; i <= n * m; i++ ){
        p.pb(i);
    }
    for ( int op = 1; op <= m; op++ ){
        auto dfs = [&](auto dfs, int lst, auto &cur) -> void{
            if ( lst == -1 ){
                return;
            }
            int l = 0, r = lst;
            while ( l < r ){
                int md = (l + r) >> 1;
                auto q = cur;
                for ( int i = 0; i <= md; i++ ){
                    q.pb(p[i]);
                }
                if ( Query(q) ) r = md;
                else l = md + 1;
            }
            us[p[l]] = true;
            cur.pb(p[l]);
            dfs(dfs, l - 1, cur);
        };
        vector <int> tmp;
        dfs(dfs, (int)p.size() - 1, tmp);
        Answer(tmp);
        vector <int> nxt;
        for ( int i = 1; i <= n * m; i++ ){
            if ( !us[i] ){
                nxt.pb(i);
            }
        } swap(p, nxt);
    }
}

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