이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[]){
vector<int> a;
int mn = 1e9;
int pos = -1;
for (int i = 0; i < n; i++){
if (inputSeq[i] <= n){
if (inputSeq[i] < mn){
pos = i;
mn = inputSeq[i];
}
}
}
for (int i = pos; i < n; i++){
a.push_back(inputSeq[i]);
}
for (int i = 0; i < pos; i++){
a.push_back(inputSeq[i]);
}
int cnt = a[0];
bool f = 0;
for (int i = 0; i < n; i++){
if (a[i] == cnt || a[i] > n){
}else f = 1;
cnt++;
}
return f;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return 0;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}
# | 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... |
# | 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... |