Submission #1290378

#	Time	Username	Problem	Language	Result	Execution time	Memory
1290378		islam_2010	Gondola (IOI14_gondola)	C++20	25 / 100	6 ms	1344 KiB

gondola

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

int valid(int n, int inputSeq[]) {
    int ind = -1;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] == 1) {
            ind = i;
            break;
        }
    }
    if (ind == -1) return 0;

    for (int i = 0; i < n; i++) {
        if (inputSeq[(ind + i) % n] != i + 1) return 0;
    }
    return 1;
}

int replacement(int n, int inputSeq[], int replacementSeq[]) {
    bool ok = false;
    int c = 0, x;
    int j = 0;
    for(int i = 0; i < n; i++){
        if(inputSeq[i] > n){
            c++;
            x = inputSeq[i];
        }
    }if(c == 0){
        return 0;
    }if(c > 1){
        return -1;
    }
    int num = -1;

    unordered_map<int, int> mp;
    for(int i = 0; i < n; i++){
        mp[inputSeq[i]] = 1;
    }for(int i = 1; i <= n; i++){
        if(!mp.count(i)){
            num = i;
            break;
        }
    }
    replacementSeq[0] = num;
    return 1;
    
}

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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