Submission #362493

#	Time	Username	Problem	Language	Result	Execution time	Memory
362493		Pety	Gondola (IOI14_gondola)	C++14	25 / 100	11 ms	1644 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;
  f.resize(250002);
  int mx = 0;
  for (int i = 0; i < n; i++) {
    f[inputSeq[i]] = 1;
    mx = max(mx, inputSeq[i]);
  }
  int l = 0;
  for (int i = 1; i <= mx; i++)
    if (!f[i])
      replacementSeq[l++] = i;
  return l;
}

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

/*int main()
{
  int aux[] = {3, 1, 4};
  int aux2[1] = {0};
  cout << replacement(3, aux, aux2);
  return 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