Submission #998838

#	Time	Username	Problem	Language	Result	Execution time	Memory
998838		Alfraganus	Gondola (IOI14_gondola)	C++17	55 / 100	15 ms	3076 KiB

gondola

#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 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10