#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]) {
int idx = -1;
map <int, bool> vis;
for (int i = 0;i < n;i++) {
if (vis[inputSeq[i]] == true) return 0;
vis[inputSeq[i]] = true;
if (inputSeq[i] <= n && idx == -1) {
idx = i;
}
}
if (idx == -1) return 1;
int cnt = inputSeq[idx];
// cout << idx << " " << cnt << endl;
for (int i = idx + 1;;i++) {
i %= n;
if (i == idx) break;
cnt %= n;
cnt++;
// cout << i << " " << cnt << endl;
if (inputSeq[i] <= n && inputSeq[i] != cnt) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[]) {
return -3;
}
//int main() {
// int arr[5] = {1, 2, 3, 4, 5};
// cout << valid(5, arr) << endl;
//}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |