| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350300 | yc11 | Art Collections (BOI22_art) | C++20 | 12 ms | 412 KiB |
#include "art.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> n1;
for (int i = 0;i<N;i++) n1.push_back(i+1);
int x = publish(n1);
while (x!=0){
for (int i = 0;i<N-1;i++){
swap(n1[i],n1[i+1]);
if (publish(n1)==x-1) {x--;break;}
else swap(n1[i],n1[i+1]);
}
}
answer(n1);
}
| # | 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... | ||||
