oj.uz

Submission #238429

# Submission time Handle Problem Language Result Execution time Memory
238429 2020-06-11T08:05:50 Z lakshith_ Gondola (IOI14_gondola) C++14
20 / 100
 51 ms 5240 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

set<int> visited;

int valid(int n,int input[]){
  for(int i=0;i<n;i++)
    if(visited.find(input[i])!=visited.end())
      return 0;
    else
      visited.insert(input[i]);
  int start = -1;
  for(int i=0;i<n;i++)if(input[i]<=n){
    start = i;
    break;
  }
  if(start==-1)return 1;
  int next = input[start];
  int pos = start;
  for(int i=0;i<n;i++){
    if(input[pos]<=n&&input[pos]!=next)return 0;
    pos++;
    if(pos>=n)pos=0;
    next++;
    if(next>n)next=1;
  }
  return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
//   int MAX = 0;
//   for(int i=0;i<n;i++){
//     visited[gondolaSeq[i]]=true;
//     MAX = max(MAX,gondolaSeq[i]);
//   }
//   int l = 0;
//   for(int i=1;i<MAX;i++)
//     if(!visited[i])replacementSeq[l++]=i;
//   return l;
// }
// int countReplacement(int n, int inputSeq[]){
  return 0;
}

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


// int main(){
//   while(true){
//     int n;
//     cin >> n;
//     int arr[n];
//     int temp[n];
//     for(int i=0;i<n;i++)cin >> arr[i];
//     cout << valid(n,arr) << "\n";
//   }
// }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 19 ms 2432 KB Output is correct
7 Correct 17 ms 1152 KB Output is correct
8 Correct 31 ms 4344 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 38 ms 5112 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 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 384 KB Output is correct
6 Correct 18 ms 2432 KB Output is correct
7 Correct 18 ms 1152 KB Output is correct
8 Correct 32 ms 4352 KB Output is correct
9 Correct 13 ms 1792 KB Output is correct
10 Correct 38 ms 4984 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 23 ms 2304 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 51 ms 5240 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -