oj.uz

Submission #746129

# Submission time Handle Problem Language Result Execution time Memory
746129 2023-05-21T13:20:15 Z Username4132 Gondola (IOI14_gondola) C++14
20 / 100
 13 ms 1236 KB 
#include "gondola.h"
#include<algorithm>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)

const int MAXN=250010;
bool seen[MAXN];

int valid(int n, int inputSeq[])
{

  forn(i, n){
    if(seen[inputSeq[i]]) return 0;
    seen[inputSeq[i]]=true;
  }

  auto itr=min_element(inputSeq, inputSeq+n);
  if(*itr>=n) return 1;
  auto tmp=itr, last=itr;
  while(true){
    if(*tmp<=n){
      int d1=*tmp-*last, d2=tmp-last;
      if(d2<0) d2+=n;
      if(d1!=d2) return 0;
      last=tmp;
    }
    tmp++;
    if(tmp==inputSeq+n) tmp=inputSeq;
    if(tmp==itr) break;
  }
  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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 288 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 584 KB Output is correct
7 Correct 9 ms 1108 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 10 ms 1176 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 12 ms 1148 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 13 ms 1064 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 852 KB Output is correct
14 Correct 1 ms 244 KB Output is correct
15 Correct 10 ms 1236 KB Output is correct

Subtask #4
0 / 5.0

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