Submission #988543

#	Time	Username	Problem	Language	Result	Execution time	Memory
988543		toan2602	Super Dango Maker (JOI22_dango3)	C++17	7 / 100	360 ms	624 KiB

dango3

#include<bits/stdc++.h>
#include "dango3.h"

using namespace std;

vector<int> ans, v2, x;
bool mark[100005];

void Solve(int n, int m) {

    for (int Q = 1; Q <= m; Q++) {
        for (int i = n * m; i >= 1; i--) if(!mark[i]) x.push_back(i);
        ans.clear();
        v2 = x;
        while(!x.empty()) {
            int cur = x.back();
            x.pop_back();
            v2 = x;
            for (int i: ans) v2.push_back(i);
            if(Query(v2) == 0) {
                ans.push_back(cur);
                mark[cur] = true;
            }
        }
        Answer(ans);
    }
}

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