제출 #134913

#제출 시각아이디문제언어결과실행 시간메모리
134913reda곤돌라 (IOI14_gondola)C++14
10 / 100
14 ms1272 KiB
#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[100005];
 
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;}
 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...