oj.uz

Submission #998838

# Submission time Handle Problem Language Result Execution time Memory
998838 2024-06-14T17:30:00 Z Alfraganus Gondola (IOI14_gondola) C++17
55 / 100
 15 ms 3076 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int a[]){
  vector<int> p;
  for(int i = 0; i < n; i ++){
    if(a[i] == 1){
      for(int j = i; j < n; j ++)
        p.push_back(a[j]);
      for(int j = 0; j < i; j ++)
        p.push_back(a[j]);
    }
  }
  if(p.size() == 0)
    return 0;
  for(int i = 0; i < n; i ++){
    if(p[i] != i + 1){
      return 0;
    }
  }
  return 1;
}

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

int replacement(int n, int a[], int replacementSeq[])
{
  int index = 0;
  for(int i = 0; i < n; i ++){
    if(a[i] <= n){
      index = (i - a[i] + 1 + n) % n;
      break;
    }
  }
  map<int, int> mp;
  int mx = 0;
  for(int i = index; i < n; i ++)
    if(a[i] > n)
      mp[a[i]] = i - index + 1, mx = max(mx, a[i]);
  for(int i = 0; i < index; i ++)
    if(a[i] > n)
      mp[a[i]] = i + n - index + 1, mx = max(mx, a[i]);
  if(mp.size() == 0)
    return 0;
  int ans = 0;
  for(int i = n + 1; i <= mx; i ++){
    if(mp.begin() -> first == i){
      replacementSeq[ans] = mp[i];
      mp.erase(mp.begin());
      ans ++;
    }
    else{
      replacementSeq[ans] = mp.begin() -> second;
      mp.begin() -> second = i;
      ans ++;
    }
  }
  return ans;
}

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

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 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 6 ms 1240 KB Output is correct
8 Correct 5 ms 1240 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 6 ms 1240 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 0 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 3 ms 860 KB Output is correct
7 Correct 6 ms 1488 KB Output is correct
8 Correct 5 ms 1240 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 1216 KB Output is correct

Subtask #4
5.0 / 5.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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 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 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 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 0 ms 348 KB Output is correct
11 Correct 5 ms 1112 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 14 ms 2652 KB Output is correct
14 Correct 5 ms 1116 KB Output is correct
15 Correct 15 ms 3076 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 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 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -