Submission #1192738

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192738		Newtonabc	Gondola (IOI14_gondola)	C++20	20 / 100	7 ms	1348 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
const int N=3e5+10;
int cnt[N];
int valid(int n, int inputSeq[])
{
  bool v=true;
  int mn=INT_MAX;
  int idx=-1;
  for(int i=0;i<n;i++){
    cnt[inputSeq[i]]++;
    if(cnt[inputSeq[i]]>1) v=false;
    if(inputSeq[i]>n) continue;
    if(mn>inputSeq[i]){
      mn=inputSeq[i];
      idx=i;
    }
  }
  //cout<<mn <<"\n";
  int now;
  if(idx!=-1){
    now=inputSeq[idx];
    for(int i=idx;i<idx+n;i++,now++){
      int con=i%n;
      if(inputSeq[con]>n) continue;
      if(inputSeq[con]!=now){
        v=false;
        //cout<<con <<" " <<now <<"\n";
      }
    }
  }
  return v;
}

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

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