Submission #134913

# Submission time Handle Problem Language Result Execution time Memory
134913 2019-07-23T12:11:03 Z reda Gondola (IOI14_gondola) C++14
10 / 100
14 ms 1272 KB
#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 time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 14 ms 1020 KB Output is correct
8 Correct 12 ms 888 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 12 ms 1016 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 632 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 11 ms 888 KB Output is correct
9 Correct 5 ms 508 KB Output is correct
10 Correct 12 ms 1016 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Incorrect 8 ms 1272 KB Output isn't correct
14 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 252 KB Output isn't correct
2 Halted 0 ms 0 KB -