제출 #652089

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652089		alvinpiter	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	312 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

/*
* If there is a duplicate, return 0.
* If all numbers are > n, return 1.
* idxMini -> index of minimum number, idxMaxi -> index of maximum number which is <= n.
  Check if all numbers which is <= n between idxMini and idxMaxi are increasing.
*/
int valid(int n, int inputSeq[]) {
  set<int> uniqGondolas;
  int idxMini = -1, idxMaxi = -1;
  for (int i = 0; i < n; i++) {
    // There is a duplicate
    if (uniqGondolas.find(inputSeq[i]) != uniqGondolas.end()) {
      return 0;
    }

    uniqGondolas.insert(inputSeq[i]);

    if (inputSeq[i] <= n) {
      if (idxMini == -1 || inputSeq[i] < inputSeq[idxMini]) {
        idxMini = i;
      }

      if (idxMaxi == -1 || inputSeq[i] > inputSeq[idxMaxi]) {
        idxMaxi = i;
      }
    }
  }

  // All numbers are > n.
  if (idxMini == -1) {
    return 1;
  }

  int lastGondola = inputSeq[idxMini];
  int currentIdx = (idxMini + 1)%n;
  do {
    if (inputSeq[currentIdx] <= n) {
      if (inputSeq[currentIdx] < lastGondola) {
        return 0;
      }

      lastGondola = inputSeq[currentIdx];
    }

    currentIdx = (currentIdx + 1)%n;
  } while (currentIdx != idxMaxi);

  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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