Submission #791950

#	Time	Username	Problem	Language	Result	Execution time	Memory
791950		caganyanmaz	Gondola (IOI14_gondola)	C++14	10 / 100	7 ms	1108 KiB

gondola

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

int n;

int fix(int i)
{
        return i % n;
}

int right(int i)
{
        return fix(i+1);
}

int valid(int nn, int v[])
{
        n = nn;
        for (int i = 0; i < n; i++)
                v[i]--;
        int mi = 0;
        for (int i = 1; i < n; i++)
                if (v[i] < v[mi])
                        mi = i;
        if (v[mi] >= n)
                return 1;
        int si = fix(mi - v[mi]);
        if (v[si] != 0 && v[si] < n)
                return 0;
        for (int j = right(si), i = 1; j != si; j=right(j), i++)
                if (v[j] != i && v[j] < n)
                        return 0;
        return 1;
}

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

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

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

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

• 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