Submission #783191

#	Time	Username	Problem	Language	Result	Execution time	Memory
783191		Minindu206	Gondola (IOI14_gondola)	C++14	20 / 100	33 ms	4576 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[])
{
  int ind = -1;
  map<int, int> mp;
  for (int i = 0; i < n; i++)
  {
    if(mp[inputSeq[i]] == 1)
      return 0;
    if(inputSeq[i] <= n)
      ind = i;
    mp[inputSeq[i]] = 1;
  }
  if(ind == -1)
    return 1;
  for(int i=0;i<n;i++)
  {
    if(inputSeq[i] <= n)
    {
      int dis_pos = (ind - i + n) % n;
      int dis_num = (inputSeq[ind] - inputSeq[i] + n) % n;
      if(dis_num != dis_pos)
        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