제출 #584773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584773		Belgutei	곤돌라 (IOI14_gondola)	C++17	20 / 100	33 ms	4552 KiB

gondola

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

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
#define MOD 1000000007
#define MOD1 1000000009

map<int,int> mp;
map<int,int> :: iterator it;

int valid(int n, int inputSeq[]) {
  mp.clear();
  int pos = -1;
  for(int i = 0; i < n; i ++) {
    if(inputSeq[i] <= n) {
      pos = i;
    }
    mp[inputSeq[i]] ++;
  }
  for(it = mp.begin(); it != mp.end(); it ++) {
    if(it -> ss > 1) {
      return 0;
    }
  }
  if(pos == -1) return 1;
  int val = inputSeq[pos];
  for(int i = pos + 1; i < n; i ++) {
    val ++;
    if(val == n + 1) val = 1;
    if(inputSeq[i] <= n && inputSeq[i] != val) return 0;
  }
  for(int i = 0; i < pos; i ++) {
    val ++;
    if(val == n + 1) val = 1;
    if(inputSeq[i] <= n && inputSeq[i] != val) return 0;
  }
  //
  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