oj.uz

Submission #230328

# Submission time Handle Problem Language Result Execution time Memory
230328 2020-05-09T14:41:37 Z joaquin Gondola (IOI14_gondola) C++14
20 / 100
 19 ms 640 KB 
#include "gondola.h"

int valid(int n, int inputSeq[])
{
  int r=1;
  for(int i=1;i<n;i++){
  	if(inputSeq[i]==1 && inputSeq[i-1]!=n){
  		r=0;
		break;
  	}
  	else if(inputSeq[i]!=1 && inputSeq[i-1]+1!=inputSeq[i]){
  		r=0;
  		break;
  	}
  }
  if(inputSeq[0]!=1 && inputSeq[n-1]+1!=inputSeq[0])r=0;
  return r;
 }


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

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 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 13 ms 640 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 14 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 19 ms 640 KB Output is correct
8 Correct 13 ms 640 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 16 ms 640 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 16 ms 640 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 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 5 ms 384 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 4 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 4 ms 256 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 5 ms 256 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 4 ms 256 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 6 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -