Submission #194170

#	Time	Username	Problem	Language	Result	Execution time	Memory
194170		juanmartinez111	Gondola (IOI14_gondola)	C++14	0 / 100	2 ms	504 KiB

gondola

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

int valid(int n, int inputSeq[]){
  int ans[n];
  int ini=0,fin=0;
  bool si=true;
  for(int i=0;i<n;i++){
    if(inputSeq[i]==n)fin=i;
    if(inputSeq[i]==1)ini=i;
    int cnt=1;
    int pos=0;
    while(ini!=fin){
        ans[pos]=inputSeq[ini];
        ini=(ini+1)%n;
        cnt++;
        pos++;
    }
    ans[pos]=inputSeq[fin];
    for(int i=0;i<n;i++){
        if(ans[i]!=i+1)si=false;
    }
  }
    if(si)return 1;
    else return 0;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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