| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1295683 | am_aadvik | Library 3 (JOI24_library3) | C++20 | 7 ms | 352 KiB |
#include <vector>
#include<algorithm>
using namespace std;
void solve(int N);
int query(std::vector<int> a);
void answer(std::vector<int> b);
void solve(int n) {
vector<int> p(n);
for (int i = 0; i < n; ++i) p[i] = i;
do {
if (query(p) == 0) { answer(p); return; }
} while (next_permutation(p.begin(), p.end()));
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
