제출 #48670

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48670		doowey	곤돌라 (IOI14_gondola)	C++14	20 / 100	16 ms	2172 KiB

gondola

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

using namespace std;
typedef pair<int,int> pii;

#define fi first
#define se second
#define mp make_pair

const int N = (int)25e4 + 1293;

int valid(int n, int inputSeq[])
{
  int cnt[N];
  for(int j = 0;j < N;j ++ )
    cnt[j] = 0;
  int rest[n];
  int maz = (int)4e5 + 12345;
  for(int i = 0; i < n;i ++){
    cnt[inputSeq[i]]++;
    if(cnt[inputSeq[i]] >= 2)
      return 0;
    maz = min(maz, inputSeq[i]);
    rest[i] = inputSeq[i];
  }
  if(maz > n)
    return 1;
  int p,j;
  for(int i = 0;i < n;i ++ ){
    if(rest[i] <= n){
      p = rest[i]+1;
      j = i+1;
      j %= N;
      while(p <= n){
        rest[j] = p;
        p++;
        j++;
        j%=n;
      }
      p = 1;
      while(p < rest[i]){
        rest[j] = p;
        j++;
        j %= n;
        p++;
      }
      break;
    }
  }
  for(int i = 0; i < n;i ++){
    if(inputSeq[i] <= n){
      if(rest[i] != inputSeq[i])
        return 0;
    }
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  vector<int>sq;
  int cnt[N];
  for(int i = 0;i < N;i ++)
    cnt[i] = 0;
  bool ok = false;
  for(int i = 0;i <n;i ++ ){
    if(gondolaSeq[i] > n)
      sq.push_back(gondolaSeq[i]);
    else{
      cnt[gondolaSeq[i]]++;
      ok = true;
    }
  }
  if(ok){
    int l = 0;
    replacementSeq[l] = 1;
    l++;
    int ii = n + 1;
    while(ii < sq[0]){
      replacementSeq[l] = ii;
      l++;
      ii++;
    }
    for(int j = 2;j <= n;j ++ ){
      replacementSeq[l] = j;
      l++;
    }
    return l;
  }
  sort(sq.begin(),sq.end());
  int p = 1;
  int l = 0;
  int ii;
  for(auto x : sq){
    while(cnt[p]!= 0)
      p++;
    if(l == 0){
      replacementSeq[l] = p;
      l++;
      ii = n + 1;
      while(ii < x){
        replacementSeq[l] = ii;
        l++;
        ii++;
      }
    }
    else{
      replacementSeq[l] = p; 
      l++;
    }
    p++;
  }
  return l;
}

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

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