Submission #1051168

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051168		inkvizytor	Gondola (IOI14_gondola)	C++17	20 / 100	11 ms	1116 KiB

gondola

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

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