Submission #536952

#	Time	Username	Problem	Language	Result	Execution time	Memory
536952		Spade1	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	440 KiB

gondola

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

int valid(int n, int inputSeq[]) {
    int _min = INT_MAX, idx;
    for (int i = 0; i < n; ++i) {
        if (inputSeq[i] < _min) {
            _min = inputSeq[i];
            idx = i;
        }
    }
    if (_min > n) return 1;
    for (int i = idx; i < idx + n; ++i) {
        if (inputSeq[(i%n)] != i) return 0;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {

}

int countReplacement(int n, int inputSeq[]) {

}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
   22 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:26:1: warning: no return statement in function returning non-void [-Wreturn-type]
   26 | }
      | ^
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:14:5: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   14 |     for (int i = idx; i < idx + n; ++i) {
      |     ^~~

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