Submission #466455

#	Time	Username	Problem	Language	Result	Execution time	Memory
466455		Carmel_Ab1	곤돌라 (IOI14_gondola)	C++17	10 / 100	20 ms	972 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

#include "gondola.h"
//#include "grader.cpp"

#define all(x) x.begin(),x.end()

int valid(int n, int inputSeq[]){
    vi a(n);
    for(int i=0; i<n; i++)
        a[i]=inputSeq[i];
    int f=-1;
    for(int i=0; i<n; i++)
        if(a[i]<=n)
            f=i;
    for(int i=0; i<n; i++)
        if(a[i]<=0)
            return 0;
    if(f==-1)return 1;
    for(int i=0,j=a[f]; i<n; j=((j%n) +1),i++){
        int cur=a[(i+f)%n];
        if(cur!=j && cur<=n)
            return 0;
    }
    sort(all(a));
    for(int i=0; i<n-1; i++)
        if(a[i]==a[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