제출 #1351868

#제출 시각아이디문제언어결과실행 시간메모리
1351868avighnaSuper Dango Maker (JOI22_dango3)C++20
2 / 100
122 ms612 KiB
#include <bits/stdc++.h>

using namespace std;

int Query(const vector<int> &x);
void Answer(const vector<int> &a);

void Solve(int N, int M) {
  vector<bool> used(N * M + 1);
  auto extract = [&]() {
    vector<int> a;
    for (int i = 1; i <= N * M; ++i) {
      if (!used[i]) {
        a.push_back(i);
      }
    }
    while (a.size() != N) {
      for (int i = 0; i < a.size(); ++i) {
        auto b = a;
        b.erase(b.begin() + i);
        if (Query(b) != 0) {
          a = b;
          break;
        }
      }
    }
    Answer(a);
    for (int &i : a) {
      used[i] = true;
    }
  };
  for (int i = 0; i < M; ++i) {
    extract();
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...