Submission #1135735

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135735		HasanV11010238	곤돌라 (IOI14_gondola)	C++20	25 / 100	44 ms	4644 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define ll long long
using namespace std;
int valid(int n, int inputSeq[])
{
    map<int, int> ma;
    int mind = -1;
    for (int i = 0; i < n; i++){
        if (inputSeq[i] <= n){
            if (mind == -1 || inputSeq[i] < inputSeq[mind]){
                mind = i;
            }
        }
        if (ma[inputSeq[i]] > 0) return 0;
        ma[inputSeq[i]]++;
    }
    if (mind == -1) return 1;
    int va = inputSeq[mind];
    for (int i = 0; i < va - 1; i++){
        mind--;
        if (mind < 0) mind = n - 1;
    }
    for (int i = 0; i < n; i++){
        int no = (i + mind) % n;
        if (inputSeq[no] <= n && inputSeq[no] != i + 1){
            return 0;
        }
    }
    return 1;
}


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


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

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10