| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 603298 | l_reho | Art Collections (BOI22_art) | C++17 | 194 ms | 208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "art.h"
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
// facciamo 20 punti
vector<int> V;
vector<int> pos(N+1, -1);
for(int i = 0; i < N; i++) V.push_back(i+1);
vector<int> init = V;
int cnt = 0;
// facciamo 35 punti
stable_sort(V.begin(), V.end(), [&](int v1, int v2){
// adesso metto affianco v1 e v2
// mi serve la posizione di v1 e v2 nel coso iniziale, faccio due swap
// creo ref e poi faccio lo swap e calcolo il nuovo reef
// vector<int> init = init_;
int posV1 = v1-1;
int posV2 = v2-1;
if(posV1 > posV2) swap(posV1, posV2);
swap(init[posV1+1], init[posV2]);
int ref = publish(init);
swap(init[posV1+1], init[posV1]);
int nref = publish(init);
// reversiamo gli swap
swap(init[posV1+1], init[posV1]);
swap(init[posV1+1], init[posV2]);
if(v1 > v2)
return nref == ref-1;
else return nref == ref+1;
});
answer(V);
}
Compilation message (stderr)
| # | 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... | ||||
