oj.uz

Submission #918320

# Submission time Handle Problem Language Result Execution time Memory
918320 2024-01-29T15:55:37 Z contest_alt Gondola (IOI14_gondola) C++17
55 / 100
 18 ms 2388 KB 
#include "gondola.h"

#include <algorithm>
#include <vector>

int valid( int n, int inputSeq[] ) {
  int shift_min = n, shift_max = -1;

  std::vector<int> vals( n );
  
  for( int i = 0 ; i < n ; i++ ){
    if( inputSeq[i] > n )
      continue;

    if( inputSeq[i] <= 0 )
      return false;

    vals[i] = inputSeq[i];

    int shift = (inputSeq[i] - 1 + n - i) % n;

    shift_min = std::min( shift_min, shift );
    shift_max = std::max( shift_max, shift );
  }

  std::sort( vals.begin(), vals.end() );
  for( int i = 1 ; i < n ; i++ )
    if( vals[i - 1] == vals[i] )
      return false;

  if( shift_max < 0 )
    return true;
  
  return shift_min == shift_max;
}

//----------------------

int replacement( int n, int gondolaSeq[], int replacementSeq[] ) {
  std::vector<int> base( n );
  bool has_base = false;

  std::vector<std::pair<int, int>> repl;

  for( int i = 0 ; i < n ; i++ ){
    int x = gondolaSeq[i];

    if( !has_base && x <= n ){
      has_base = true;
      
      for( int j = 0 ; j < n ; j++ )
        base[(i + j) % n] = (x - 1 + j) % n + 1;
    }

    if( x > n )
      repl.emplace_back( x, i );
  }

  if( !has_base )
    for( int i = 0 ; i < n ; i++ )
      base[i] = i + 1;

  std::sort( repl.begin(), repl.end() );

  int len = 0, last = n;
  for( auto p : repl ){
    // o nu... nu am c++17 in 2014
    int idx = p.second;
    int val = p.first;

    while( base[idx] != val ){
      replacementSeq[len++] = base[idx];
      base[idx] = ++last;
    }
  }

  return len;
}

//----------------------

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
2 Correct 1 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
6 Correct 7 ms 604 KB Output is correct
7 Correct 11 ms 1112 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 11 ms 1000 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 604 KB Output is correct
7 Correct 11 ms 1116 KB Output is correct
8 Correct 7 ms 860 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 11 ms 860 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 10 ms 1116 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 416 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 500 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 7 ms 1368 KB Output is correct
12 Correct 7 ms 1628 KB Output is correct
13 Correct 15 ms 1720 KB Output is correct
14 Correct 8 ms 1324 KB Output is correct
15 Correct 18 ms 2388 KB Output is correct

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 0 ms 600 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -