제출 #232018

#제출 시각아이디문제언어결과실행 시간메모리
232018pere_gil곤돌라 (IOI14_gondola)C++14
0 / 100
5 ms384 KiB
#include "gondola.h"
  
  int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return -3;
}

int countReplacement(int n, int inputSeq[]){
return -3;
}

int valid(int n, int inputSeq[]){
    int res=1;
    for(int i=0;i<n-1;i++){
        if(inputSeq[i+1]!=1 and inputSeq[i+1]-1!=inputSeq[i]){
            res=0;
        }
        if(inputSeq[i]==1){
            if(i==0){
                if(n!=inputSeq[n-1]){
                    res=0;
                }
            }
            if(i!=0){
                if(inputSeq[i-1!=n]){
                    res=0;
                }
            }
        }
    }
    if(inputSeq[0]-1!=inputSeq[n-1]){
        res=0;
    }
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...