Submission #1290377

#	Time	Username	Problem	Language	Result	Execution time	Memory
1290377		islam_2010	곤돌라 (IOI14_gondola)	C++20	20 / 100	6 ms	1356 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];
        }
    }int num;
    sort(inputSeq, inputSeq + n);
    for(int i = 1; i <= n; i++){
        if(inputSeq[i-1] != i){
            num = i;
            break;
        }
    }
    if(c == 1 && x == n+1){
        replacementSeq[0] = num;
        return 1;
    }
}

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

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^

• 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