Submission #1318818

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318818		afric	Gondola (IOI14_gondola)	C++20	0 / 100	1 ms	332 KiB

gondola

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

int valid(int n, int inputSeq[])
{
    unordered_set<int> used;
    int current = -1;
    for (int i = 0; i < n; i++)
    {
        if (current==-1 && inputSeq[i] <= n)
        {
            current = inputSeq[i];
            continue;
        }
        if (inputSeq[i] > n)
        {
            if (used.find(inputSeq[i])!=used.end())
            {
                return 0;
            }
            used.insert(inputSeq[i]);
        }
        if (inputSeq[i] <= n && inputSeq[i] != (current+1))
        {
            return 0;
        }
        if (inputSeq[i] <= n)
        {
            current=inputSeq[i];
        }
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    return 0;
}
int countReplacement(int n, int inputSeq[])
{
    return 0;
}

/*int main()
{
    int s[7] = {1, 8, 2, 8, 3, 4, 5};
    cout << valid(7,s) << endl;
}*/

• 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