Submission #842644

#	Time	Username	Problem	Language	Result	Execution time	Memory
842644		Warinchai	Gondola (IOI14_gondola)	C++14	20 / 100	33 ms	5296 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int s[])
{
    map<int,int>mp;
    int prev=0,count=0;
    int first=0;
    int mn=INT_MAX;
    int idm=0;
    for(int i=0;i<n;i++){
        mp[s[i]]++;
        if(mp[s[i]]>1){
            return 0;
        }
        if(s[i]<=n){
            if(first==0){
                first=s[i];
            }
            if(s[i]<mn){
                mn=s[i];
                idm=i;
            }
            if(s[i]<prev){
                count++;
            }
            prev=s[i];
        }
    }
    if(first<prev){
        count++;
    }
    if(count>1){
        return 0;
    }
    for(int i=idm;i<idm+n&&first+i-idm<=n;i++){
        int id=i%n;
        if(s[id]<=n){
            if(s[id]!=mn+i-idm){
                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