제출 #138669

#제출 시각아이디문제언어결과실행 시간메모리
138669zoooma13곤돌라 (IOI14_gondola)C++14
10 / 100
13 ms632 KiB
#include "bits/stdc++.h"
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
    int mi_idx = min_element(inputSeq ,inputSeq+n)-inputSeq;
    if(inputSeq[mi_idx] >= n)
        return 1;
    int nxt = inputSeq[mi_idx];
    for(int i=mi_idx; i<mi_idx+n; i++){
        if(inputSeq[i%n] != nxt && inputSeq[i%n] <= n)
            return 0;
        nxt++;
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#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...