Submission #1198047

#	Time	Username	Problem	Language	Result	Execution time	Memory
1198047		njoop	곤돌라 (IOI14_gondola)	C++20	20 / 100	10 ms	1220 KiB

gondola

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

using namespace std;

int valid(int n, int inputSeq[]) {
  int st=0, mn=1e9;
  vector<int> v;
  for(int i=0; i<n; i++) {
    v.push_back(inputSeq[i]);
    if(inputSeq[i] <= n && inputSeq[i] < mn) {
      mn = inputSeq[i];
      st = i;
    }
  }
  sort(v.begin(), v.end());
  for(int i=1; i<n; i++) {
    if(v[i] == v[i-1]) return 0;
  }
  if(mn == 1e9) return 1;
  for(int i=st; i<n; i++) {
    if(inputSeq[i] <= n && inputSeq[i] != mn) return 0;
    mn++;
  }
  for(int i=0; i<st; i++) {
    if(inputSeq[i] <= n && inputSeq[i] != mn) return 0;
    mn++;
  }
  return 1;
}

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

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

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

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

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