Submission #204566

#	Time	Username	Problem	Language	Result	Execution time	Memory
204566		a_player	Gondola (IOI14_gondola)	C++14	55 / 100	27 ms	2420 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define f first
#define s second
#define mp make_pair
#define rep replacementSeq

using namespace std;

const int MAXN = 250e3+5;

bitset<MAXN> v;

int valid(int n, int inputSeq[])
{
    int cont=0;
    for(int i=0;i<n;i++)if(inputSeq[i]>n)cont++;
    int mas=*max_element(inputSeq,inputSeq+n);
    if(mas!=n+cont)return 0;
    for(int i=0;i<n;i++){
        if(v[inputSeq[i]])return 0;
        v[inputSeq[i]]=1;
    }
    int mini=min_element(inputSeq,inputSeq+n)-inputSeq;
    int ans=1;
    if(inputSeq[mini]>n)return 1;
    int i=(mini-inputSeq[mini]+1+n)%n;
    for(int j=0;j<n-1;j++){
        if(inputSeq[(i+j)%n]>n||inputSeq[(i+j+1)%n]>n)continue;
        ans*=(inputSeq[(i+j)%n]+1==inputSeq[(i+j+1)%n]);
    }
    
    return ans;
}

//----------------------
vector<pair<int,int> > a;
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int ind=-1;
  for(int i=0;i<n;i++)if(gondolaSeq[i]<=n)ind=i;
  if(ind==-1){
    for(int j=0;j<n;j++)a.push_back(mp(gondolaSeq[j],j+1));
  }else{
  ind=(ind-gondolaSeq[ind]+1+n)%n;
  for(int j=0;j<n;j++)a.push_back(mp(gondolaSeq[(ind+j)%n],j+1));
  }
  sort(a.begin(),a.end());
  int id=0;
  int k=n;
  for(pair<int,int> x:a){
    if(x.f==x.s)continue;
      rep[id++]=x.s;
      for(k+=1;k<x.f;k++)rep[id++]=k;
  }
  return id;
}

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

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

• 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: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10