Submission #1302866

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302866		Faggi	Gondola (IOI14_gondola)	C++20	10 / 100	6 ms	1344 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

int valid(int n, int inputSeq[])
{
    ll in = -1, i, x, sig;
    for (i = 0; i < n; i++)
    {
        if (inputSeq[i] <= n)
        {
            in = i;
            x = inputSeq[i];
            break;
        }
    }
    if (in == -1)
        return 1;
    i = (in + 1) % n;
    sig = (x + 1) % (n + 1);
    if (sig == 0)
        sig = 1;
    while (i != in)
    {
        if (inputSeq[i] <= n && sig != inputSeq[i])
            return 0;
        i = (i + 1) % n;
        sig = (sig + 1) % (n + 1);
        if (sig == 0)
            sig = 1;
    }
    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: 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