oj.uz

Submission #238430

# Submission time Handle Problem Language Result Execution time Memory
238430 2020-06-11T08:20:18 Z lakshith_ Gondola (IOI14_gondola) C++14
20 / 100
 50 ms 4728 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 start = 0;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]<=n){start = i;break;}
  }
  int next = gondolaSeq[start]<=n?gondolaSeq[start]:1;
  vector<pair<int,int>> vec;
  int pos = 0;
  for(int i=0;i<n;i++){
    vec.push_back({gondolaSeq[pos++],next++});
    if(next>n)next = 1;
    if(pos>=n)pos=0;
  }
  sort(vec.begin(),vec.end());
  int last = n;
  int l = 0;
  for(int i=0;i<n;i++){
    while(vec.at(i).first != vec.at(i).second){
      replacementSeq[l++] = vec.at(i).second;
      vec.at(i).second = ++last;
    }
  }
  return l;
}

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 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 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 18 ms 2176 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 31 ms 3960 KB Output is correct
9 Correct 12 ms 1536 KB Output is correct
10 Correct 36 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 18 ms 2176 KB Output is correct
7 Correct 21 ms 732 KB Output is correct
8 Correct 30 ms 3960 KB Output is correct
9 Correct 12 ms 1536 KB Output is correct
10 Correct 37 ms 4600 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 22 ms 2048 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 50 ms 4728 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Runtime error 7 ms 3200 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Runtime error 8 ms 3328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Runtime error 8 ms 3200 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 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 5 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 384 KB Output isn't correct
2 Halted 0 ms 0 KB -