제출 #417769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417769		arneves	곤돌라 (IOI14_gondola)	C++17	0 / 100	1 ms	272 KiB

gondola

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

using namespace std;

typedef long long ll;

#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()

const int MOD = 1'000'000'007;
const int MX = 100'005;
//long double PI = 3.14159265358979323846264338327950;


int valid(int n, int inputSeq[])
{
  //return -1;

    int a[n+1];
    memset(a,0,sizeof(a));

    for(int i=0; i<n; i++){

        if(inputSeq[i]>=n){
            if(a[inputSeq[i]]!=0){
                return 0;
            }
            a[inputSeq[i]]=i;
        }
    }

    for(int i=1; i<=n; i++){

        if(a[i]!=0&&a[i-1]){

            if((a[i]+1)%n!=a[i]%n){
                return 0;
            }
        }
    }

    return 1;
}

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

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

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

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

/*void caso_teste(){


}*/

/*int main(){

    cin.tie(0);ios_base::sync_with_stdio(0);
    //freopen ("in.txt","r",stdin);

    int n_casos=1; //cin>>n_casos;

    //while(n_casos--) caso_teste();
    int a[5]={10, 4, 3, 11, 12};
    cout<<valid(5, a);
}*/

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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