oj.uz

Submission #161288

# Submission time Handle Problem Language Result Execution time Memory
161288 2019-11-01T17:08:22 Z DavidDamian Gondola (IOI14_gondola) C++11
20 / 100
 15 ms 1604 KB 
#include "gondola.h"
#include<iostream>
///Determine weather a sequence is valid
///Construct a replacement sequence
///Count the number of replacement sequences
using namespace std;
int bucket[250005];
int findFirst (int n,int A[]){ ///Finds the first element in the arrar less or equal to n
  for(int i=0;i<n;i++){
    if(A[i]<=n)
      return i;
  }
  return -1;
}
int valid(int n, int inputSeq[])
{
  int id=findFirst(n,inputSeq);
  for(int i=0;i<n;i++){
    if(bucket[ inputSeq[i] ]==1) //Checks every element to not be repeated
      return 0;
    bucket[inputSeq[i]]=1;
  }
  if(id==-1) //If there are no repeated elements and all elemets are greater than n, the sequence is valid
    return 1;
  int x=inputSeq[id];
  for(int i=0;i<n;i++){ //Otherwise checks for each element if it is the same than expected (x)
    if(inputSeq[(id+i)%n]<=n)
      if(inputSeq[(id+i)%n]!=x)
	return 0;
    x++;
    if(x==n+1)
      x=1;
  }
  return 1;
}

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

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

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

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

Subtask #1
5.0 / 5.0

# 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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 7 ms 888 KB Output is correct
7 Correct 15 ms 1528 KB Output is correct
8 Correct 12 ms 1272 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1528 KB Output is correct

Subtask #3
10.0 / 10.0

# 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 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 760 KB Output is correct
7 Correct 14 ms 1532 KB Output is correct
8 Correct 12 ms 1272 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1400 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 8 ms 1528 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 15 ms 1604 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 368 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -