제출 #285521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285521		erd1	곤돌라 (IOI14_gondola)	C++14	60 / 100	28 ms	2944 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef int64_t lld;
typedef pair<int, int> pii;
typedef long double ld;

int valid(int n, int inputSeq[]) {
  set<int> uses;
  for(int i = 0; i < n; i++)if(inputSeq[i] <= n){
    rotate(inputSeq, inputSeq+i, inputSeq+n);
    if(inputSeq[0] != 1) rotate(inputSeq, inputSeq + (n-inputSeq[0]+1), inputSeq + n);
    break;
  }
  for(int i = 0; i < n; i++)
    if(inputSeq[i] == i+1) continue;
    else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]);
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  map<int, int> mp;
  for(int i = 0; i < n; i++)if(gondolaSeq[i] <= n){
    rotate(gondolaSeq, gondolaSeq+i, gondolaSeq+n);
    if(gondolaSeq[0] != 1) rotate(gondolaSeq, gondolaSeq + (n-gondolaSeq[0]+1), gondolaSeq + n);
    break;
  }
  for(int i = 0; i < n; i++)if(gondolaSeq[i] > n)mp[gondolaSeq[i]] = i+1;
  int cur = 0;
  for(auto i: mp){
    int l = i.ss;
    while(cur+n < i.ff)
      replacementSeq[cur++] = l, l = n+cur;
  }
  return cur;
}

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

int countReplacement(int n, int inputSeq[]) {
  if(!valid(n, inputSeq))return 0;
  return 1;
}

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