Submission #297795

#	Time	Username	Problem	Language	Result	Execution time	Memory
297795		juckter	Gondola (IOI14_gondola)	C++14	20 / 100	36 ms	4992 KiB

gondola

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

const int MAXV = 3e5 + 10;


int valid(int n, int inputSeq[]) {
    set<int> seen;
    int rot = -1;
    for(int i = 0; i < n; i++) {
        if(seen.count(inputSeq[i]))
            return 0;
        seen.insert(inputSeq[i]);
        if(inputSeq[i] <= n) {
            int nr = (inputSeq[i] - i + n) % n;
            if(rot != -1 && rot != nr)
                return 0;
            rot = nr;
        }
    }
    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