제출 #433711

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

gondola

#include<bits/stdc++.h>
#include "gondola.h"
#define ll  long long
using namespace std;
int valid(int n, int inputSeq[])
{
  int h=1;
  for(int i=1;i<n;i++){
    if(inputSeq[i]!=(inputSeq[i-1]%n+1))
        h=0;
  }
  return h;
}
int replacement(int n, int gs[], int rs[])
{
  vector<pair<ll,ll> > fi(n);
  fi[0]=make_pair(-1,-1);
    for(int i=0;i<n;i++){
    if(gs[i]<=n){
        for(int j=i;j<i+n;j++){
            fi[j%n]=make_pair(-gs[j%n],(gs[i]+(j-i))%n+1);
        }
        break;
    }
  }
  ll pt=0;
  if(fi[0].second==-1)
  for(int i=0;i<n;i++){
    fi[i]=make_pair(-gs[i],i+1); 
  }
  sort(fi.begin(),fi.end());
  ll ind=n+1;
  while(ind>-fi[fi.size()-1].first)
    fi.pop_back();
  while(fi.size()){
    ll k=fi.size()-1;
       
    while(ind<=-fi[k].first){
        rs[pt]=fi[k].second;
        fi[k].second=ind;
        ind++;
        pt++;
        k--;
        fi.pop_back();
    }
  }
  return pt;
}

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

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