Submission #842751

#	Time	Username	Problem	Language	Result	Execution time	Memory
842751		Pacybwoah	Gondola (IOI14_gondola)	C++17	20 / 100	19 ms	1752 KiB

gondola

#include<algorithm>
#include<vector>
#include<iostream>
#include"gondola.h"
using namespace std;

int valid(int n, int inp[])
{
    vector<int> vec;
    for(int i=0;i<n;i++) vec.push_back(inp[i]);
    sort(vec.begin(),vec.end());
    if(unique(vec.begin(),vec.end())-vec.begin()!=n) return 0;
    int first=-1;
    for(int i=0;i<n;i++){
        if(inp[i]<=n){
            first=i;
            break;
        }
    }
    if(first==-1) return 1;
    bool flag=1;
    for(int i=0;i<n;i++){
        if(inp[i]!=(inp[first]+i-first-1+n)%n+1&&inp[i]<=n){
            flag=0;
            break;
        }
    }
    return flag;
}

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

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