이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
int st = 0;
for(int i = 0; i < n; i++){
if(inputSeq[i] == 1)st = i;
}
for(int it = 0; it < n - 2; it++){
int p = (it + st) % n;
int nx = (it + 1 + st) % n;
if(inputSeq[p] > n || inputSeq[nx] > n){
continue;
}
if(inputSeq[nx] - inputSeq[p] != 1){
return 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int mx = 0;
for(int i = 0; i < n; i++)mx = max(mx, gondolaSeq[i]);
vector<int> used(mx + 1, 0);
for(int i = 0; i < n; i++)used[gondolaSeq[i]] = 1;
int l = 0;
for(int i = 1; i <= mx; i++){
if(!used[i]){
replacementSeq[l++] = i;
}
}
return l;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
# | 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... |