oj.uz

Submission #1064618

# Submission time Handle Problem Language Result Execution time Memory
1064618 2024-08-18T15:45:30 Z NemanjaSo2005 Gondola (IOI14_gondola) C++17
10 / 100
 6 ms 1884 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
int N,niz[maxn],niz2[maxn];
void adjust(){
   int najm=1;
   for(int i=1;i<=N;i++)
      if(niz[i]<niz[najm])
         najm=i;
   for(int i=1;i<=N;i++){
      if(i+najm-1<=N)
         niz2[i]=niz[i+najm-1];
      else
         niz2[i]=niz[i+najm-N-1];
   }
   for(int i=1;i<=N;i++)
      niz[i]=niz2[i];
}
int valid(int n, int inputSeq[]){
   N=n;
   for(int i=1;i<=N;i++)
      niz[i]=inputSeq[i-1];
   adjust();/*
   for(int i=1;i<=N;i++)
      cout<<niz[i]<<" ";
   cout<<endl;*/
   if(niz[1]>=N)
      return 1;
   int treba=niz[1];
   for(int i=2;i<=N;i++){
      treba++;
      if(niz[i]>N)
         continue;
      if(niz[i]!=treba)
         return 0;
   }
   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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 6 ms 1880 KB Output is correct
8 Correct 5 ms 1592 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 6 ms 1884 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 420 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 6 ms 1748 KB Output is correct
8 Correct 5 ms 1592 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 6 ms 1716 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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