oj.uz

Submission #230296

# Submission time Handle Problem Language Result Execution time Memory
230296 2020-05-09T13:51:48 Z chubyxdxd Gondola (IOI14_gondola) C++17
10 / 100
 20 ms 1792 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
int valid(int n, int inputSeq[])
{
  int vis[300000];
  memset(vis,0,sizeof vis);
  int mini=300000;
  int pos=0;
  for(int i=0;i<n;i++){
    if(inputSeq[i]<mini){
      mini=inputSeq[i];
      pos=i;
    }
  }
  int i=0;
  int j=pos;
  int sw=0;
  while(i<n){
    
    if(j==n)j=0;
    if(inputSeq[j]<i+1 or vis[inputSeq[j]]==1)sw=1;
    vis[inputSeq[j]]=1;
    j++;
    i++;
  }
  if(sw)return 0;
  else 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 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 6 ms 1536 KB Output is correct
3 Correct 6 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 18 ms 1792 KB Output is correct
8 Correct 18 ms 1792 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 19 ms 1792 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 6 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 11 ms 1664 KB Output is correct
7 Correct 19 ms 1792 KB Output is correct
8 Correct 15 ms 1792 KB Output is correct
9 Correct 8 ms 1536 KB Output is correct
10 Correct 20 ms 1792 KB Output is correct
11 Correct 5 ms 1536 KB Output is correct
12 Incorrect 5 ms 1536 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 5.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 #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 4 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 5 ms 384 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 5 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -