Submission #362498

#	Time	Username	Problem	Language	Result	Execution time	Memory
362498		Pety	Gondola (IOI14_gondola)	C++14	25 / 100	12 ms	3436 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid (int n, int inputSeq[]) {
  vector<int>f;
  f.resize(250002);
  for (int i = 0; i < n; i++) {
    int next = (i + 1) % n;
    if (f[inputSeq[i]])
      return 0;
    f[inputSeq[i]] = 1;
    if (inputSeq[i] <= n && inputSeq[next] <= n) {
      if (inputSeq[i] == n && inputSeq[next] != 1)
        return 0;
      else if (inputSeq[i] < n && inputSeq[next] != inputSeq[i] + 1)
        return 0;
    }
  }
  return 1;
}

int replacement (int n, int inputSeq[], int replacementSeq[]) {
  vector<int>f, pozFinal, poz;
  f.resize(250002);
  pozFinal.resize(250002);
  poz.resize(250002);
  int mx = 0;
  int start = 0;
  for (int i = 0; i < n; i++) {
    f[inputSeq[i]] = 1;
    if (inputSeq[i] <= n)
      start = (i - inputSeq[i] + 1 + n) % n;
    pozFinal[inputSeq[i]] = i;
    mx = max(mx, inputSeq[i]);
  }
  set<int>s;
  for (int i = 1; i <= n; i++) {
    inputSeq[start] = i;
    poz[i] = start;
    start = (start + 1) % n;
    if (!f[i])
      s.insert(i);
  }
  int l = 0;
  int next = n + 1;
  for (int i = 1; i <= mx - n; i++) {
    if (f[next]) {
      replacementSeq[i - 1] = inputSeq[pozFinal[next]];
      s.erase(replacementSeq[i]);
    }
    else {
      replacementSeq[i - 1] = *s.begin();
      s.erase(replacementSeq[i]);
      s.insert(next);
      inputSeq[poz[replacementSeq[i - 1]]] = next;
      poz[next] = poz[replacementSeq[i - 1]];
    }
    next++;
  }
  return mx - n;
}

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

/*int main()
{
  int aux[] = {2, 3, 4, 9, 6, 7, 1};
  int aux2[1] = {0};
  cout << replacement(7, aux, aux2);
  return 0;
}*/

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:46:7: warning: unused variable 'l' [-Wunused-variable]
   46 |   int l = 0;
      |       ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10