Submission #988540

#TimeUsernameProblemLanguageResultExecution timeMemory
988540toan2602Super Dango Maker (JOI22_dango3)C++17
0 / 100
78 ms612 KiB
#include<bits/stdc++.h>
#include "dango3.h"

using namespace std;

vector<int> ans, v2, x;

void Solve(int n, int m) {

    for (int i = n * m; i >= 1; i--) x.push_back(i);
    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);
        }
    }
    Answer(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...