Submission #107691

#	Time	Username	Problem	Language	Result	Execution time	Memory
107691		FiloSanza	곤돌라 (IOI14_gondola)	C++14	10 / 100	16 ms	1552 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int N, int inputSeq[])
{
    vector<int> v(N);
    for(int i=0; i<N; i++) v[i] = inputSeq[i];
    
    int mini = min_element(v.begin(), v.end()) - v.begin();

    for(int i=mini+1; i != mini; i=(i+1)%N){
        if(v[i] > N) continue;
        if(i == 0 && v.back() <= N && v.front() <= v.back()) return 0;
        if(v[i-1] <= N && v[i] <= v[i-1]) return 0; 
    }

    return 1;
}

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

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

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10