| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1246266 | adam17 | Art Collections (BOI22_art) | C++20 | 56 ms | 396 KiB |
#include "art.h"
#include <algorithm>
using namespace std;
int NN;
bool compare(int a, int b) {
vector<int> V(2);
V[0] = a;
V[1] = b;
for (int i = 1; i <= NN; i++) {
if ((i != a) && (i != b)) {
V.push_back(i);
}
}
int x = publish(V);
V[0] = b;
V[1] = a;
int y = publish(V);
return x < y;
}
void solve(int N) {
NN = N;
vector<int> X(N);
for (int i = 0; i < N; i++) {
X[i] = i + 1;
}
sort(X.begin(), X.end(), compare);
answer(X);
}
| # | 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... | ||||
