| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1231239 | omsincoconut | Art Collections (BOI22_art) | C++17 | 0 ms | 408 KiB |
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> p(N);
iota(p.begin(), p.end(), 1);
int cur = publish(p);
for (int i = N-2; i >= 0; i--) {
for (int j = 0; j < i; j++) {
vector<int> np = p;
swap(np[j], np[j+1]);
if (publish(np) < publish(p)) p = np;
}
}
answer(p);
}
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
