제출 #638239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
638239		Seb	Gondola (IOI14_gondola)	C++17	20 / 100	17 ms	1320 KiB

gondola

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

using namespace std;

typedef long long ll;

int valid(int n, int inputSeq[]) {
    ll i,mn=0,aux[n];
    bool resp=true;
    for (i=0;i<n;i++) {
        aux[i] = inputSeq[i];
        if (aux[mn]>aux[i]) mn = i;
    }
    sort(aux,aux+n);
    for (i=0;i<n-1;i++) if (aux[i]==aux[i+1]) return 0;
    for (i=mn;i<n;i++) if (inputSeq[i]<=n) {
        if (inputSeq[i]!=i-mn+1) resp = false;
    }
    for (i=0;i<mn;i++) if (inputSeq[i]<=n) {
        if (inputSeq[i]!=(n-mn)+i+1) resp = false;
    }
    if (resp==true) return 1;
    else return 0;
}

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

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: 10 / 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