Submission #435736

#	Time	Username	Problem	Language	Result	Execution time	Memory
435736		chirathnirodha	Gondola (IOI14_gondola)	C++17	20 / 100	13 ms	1484 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define P push
typedef long long ll;

int valid(int n, int inputSeq[]){
  int arr[n];
  for(int i=0;i<n;i++){
    if(inputSeq[i]<=n){
      int pp=inputSeq[i]-i-1+n;
      for(int j=0;j<n;j++){
        arr[(pp+j)%n]=inputSeq[j];
      }
      break;
    }
  }
  for(int i=0;i<n;i++)if(arr[i]<=n && arr[i]-1!=i)return 0;
  sort(arr,arr+n);
  for(int i=1;i<n;i++)if(arr[i]==arr[i-1])return 0;
  return 1;
}

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

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