| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351868 | avighna | Super Dango Maker (JOI22_dango3) | C++20 | 122 ms | 612 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
