Submission #282395

#	Time	Username	Problem	Language	Result	Execution time	Memory
282395		iliccmarko	Gondola (IOI14_gondola)	C++14	25 / 100	38 ms	4988 KiB

gondola

#include <bits/stdc++.h>
#include<gondola.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;


int valid(int n, int p[])
{
    map<int, int> m;
    m[p[0]]++;
    for(int i = 1;i<n;i++)
    {
        if(m.find(p[i])!=m.end())
            {
                //cout<<i;
                return 0;
            }
        if(p[i]==1&&p[i-1]<n)
            {
                //cout<<i;
                return 0;
            }
        else if(p[i]!=1&&p[i]-1!=p[i-1]&&p[i-1]<=n&&p[i]<=n)
            {
                //cout<<i;
                return 0;
            }
        m[p[i]]++;
    }
    return 1;
}

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

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

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10