# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
887900 | qrno | Art Collections (BOI22_art) | C++17 | 1273 ms | 1896 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
// CODIGO DA ESTELA!!!!! (eu ajudei talvez)
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
//publish(order)
// answer(order)
//
// --- 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
//
void solve(int N) {
vector<int> v(N);
iota(v.begin(),v.end(),1);
int q = publish(v);
for(int i=1; i<N; i++){ //k =i
vector<int> aux;
aux.push_back(i+1);
for(auto j: v){
if(j == v[i]) continue;
aux.push_back(j);
}
int q2 = publish(aux);
int y = q2 - q+i;
y /= 2;
vector<int> novo;
for(int j = 0; j<N; j++){
if(j == y) novo.push_back(i+1);
else if(j < y) novo.push_back(v[j]);
else if( j> y and j <= i) novo.push_back(v[j-1]);
else if(j > y and j > i) novo.push_back(v[j]);
}
v = novo;
q= q2 - y;
}
answer(v);
return;
}
컴파일 시 표준 에러 (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... |