Submission #1001726

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001726		codexistent	Gondola (IOI14_gondola)	C++14	5 / 100	1 ms	600 KiB

gondola

#include <iostream>
#include <set>
#include <gondola.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)

int diff(int n, int a, int b){
    if(b >= a) return b - a;
    else return (n - a) + b;
}

int valid(int n, int inputSeq[]){
    pair<int, int> prev = {-1, 0};
    set<int> s;
    FOR(i, 0, n - 1){
        if(inputSeq[i] <= n){
            if(prev.first == -1){
                prev = {i, inputSeq[i]};
            }else{
                if(prev.second + diff(n, prev.first, i) != inputSeq[i]) return 0;
                prev = {i, inputSeq[i]};
            }
        }else{
            if(s.find(inputSeq[i]) != s.end()) return 0;
            s.insert(inputSeq[i]);
        }
    }

    return 1;
}

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

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

/*int main(){
    int t, x;
    cin >> t >> x;
    const int n = x;

    int arr[n];
    FOR(i, 0, n - 1) cin >> arr[i];

    if(t <= 3) valid(x, arr);
    else if(t <= 6) {
        int rep[n];
        replacement(x, arr, rep);
    }else{
        countReplacement(x, arr);
    }
}

*/

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10