oj.uz

Submission #1025355

# Submission time Handle Problem Language Result Execution time Memory
1025355 2024-07-16T23:38:56 Z HappyCapybara Gondola (IOI14_gondola) C++17
55 / 100
 12 ms 3948 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
  int x = -1;
  unordered_set<int> s;
  for (int i=0; i<n; i++){
    if (s.find(inputSeq[i]) != s.end()) return 0;
    s.insert(inputSeq[i]);
    if (inputSeq[i] <= n){
      if (x != -1 && x != inputSeq[i]) return 0;
      if (x == -1) x = inputSeq[i];
    }
    if (x != -1) x = (x % n) + 1;
  }
  return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  vector<int> v(n);
  int x = -1;
  for (int i=0; i<2*n; i++){
    if (x != -1){
      v[x] = gondolaSeq[i%n];
      x = (x+1) % n;
    }
    else {
      if (i == n){
        v[0] = gondolaSeq[i%n];
        x = 1;
      }
      else if (gondolaSeq[i] <= n) x = gondolaSeq[i] % n;
    }
  }
  vector<pair<int,int>> w(n);
  for (int i=0; i<n; i++) w[i] = {v[i], i+1};
  sort(w.begin(), w.end());
  int cur = 0, last = n;
  for (int i=0; i<n; i++){
    if (w[i].first == w[i].second) continue;
    else {
      replacementSeq[cur] = w[i].second;
      cur++;
      last++;
      while (last != w[i].first){
        replacementSeq[cur] = last;
        cur++;
        last++;
      }
    }
  }
  return cur;
}

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 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 5 ms 1928 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 8 ms 3436 KB Output is correct
9 Correct 3 ms 1628 KB Output is correct
10 Correct 9 ms 3948 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 4 ms 1976 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 8 ms 3400 KB Output is correct
9 Correct 3 ms 1628 KB Output is correct
10 Correct 10 ms 3944 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 6 ms 600 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 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 #5
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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 348 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 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 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 ms 2136 KB Output is correct
12 Correct 8 ms 2140 KB Output is correct
13 Correct 9 ms 1476 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 12 ms 2236 KB Output is correct

Subtask #7
0 / 5.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 #8
0 / 15.0

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