Submission #589447

#	Time	Username	Problem	Language	Result	Execution time	Memory
589447		AlperenT	Gondola (IOI14_gondola)	C++17	10 / 100	15 ms	1668 KiB

gondola

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

using namespace std;

int valid(int n, int arr[]){
    int arr2[n];

    copy(arr, arr + n, arr2);

    sort(arr2, arr2 + n);

    if(unique(arr2, arr2 + n) != arr2 + n) return false;

    int mn = *min_element(arr, arr + n);

    if(mn > n) return true;
    else{
        vector<int> v;

        for(int i = 0; i < n; i++){
            if(arr[i] == mn){
                for(int j = i; j < n; j++) if(arr[j] <= n) v.push_back(arr[j]);
                for(int j = 0; j < i; j++) if(arr[j] <= n) v.push_back(arr[j]);

                break;
            }
        }

        int curmax = 0;

        for(auto i : v){
            if(i <= curmax) return false;
            else curmax = i;
        }

        return true;
    }
}

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

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