이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "gondola.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
int vis[1000001];
int valid(int n, int inputSeq[])
{
int ind = 0;
int num = 0;
for(int i = 0 ; i< n ; i++){
if(inputSeq[i]>=1 && inputSeq[i] <=n ){
ind = i;
num = inputSeq[i];
}
if(inputSeq[i] <1)
return 0;
if(vis[inputSeq[i]] ==1)
return 0;
vis[inputSeq[i]]=1;
}
if(num==0)
return 1;
for(int i = 0 ; i < n; i++)
if(inputSeq[i] <= n){
if( (ind + (inputSeq[i] - num) +n ) %n!=i )
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]);
return mx - n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
int ind = 0;
int num = 0;
for(int i = 0 ; i< n ; i++){
if(inputSeq[i]>=1 && inputSeq[i] <=n ){
ind = i;
num = inputSeq[i];
}
if(inputSeq[i] <1)
return 0;
if(vis[inputSeq[i]] ==1)
return 0;
vis[inputSeq[i]]=1;
}
if(num!=0)
for(int i = 0 ; i < n; i++)
if(inputSeq[i] <= n){
if( (ind + (inputSeq[i] - num) +n ) %n!=i )
return 0;
}
return 1;
}
# | 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... |