Submission #134461

#	Time	Username	Problem	Language	Result	Execution time	Memory
134461		reda	Gondola (IOI14_gondola)	C++14	0 / 100	2 ms	504 KiB

gondola

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

using namespace std ;
#define endl '\n'
#define ll   long long
#define fi   first
#define se   second
#define mp   make_pair
#define pb   push_back
#define MOD  1000000007
    int occ[101];

int valid(int n, int a[])
{
   for(int i=0;i<n;i++)
   {
       occ[a[i]]++;
   }
   for(int i=0;i<n;i++)
   {
       if(occ[a[i]]>1)return 0;
   }
   for(int i=1;i<n;i++)
   {
       if(a[i]>n && a[i]>a[i-1]+1)
        return 0;
   }
   return 1;
}
int  replacement( int  n, int gondolaSeq[],int replacementSeq []){return 0;}
int countReplacement(int n, int inputSeq[]){return 0;}

• 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