Submission #1356168

#	Time	Username	Problem	Language	Result	Execution time	Memory
1356168		marselel	Gondola (IOI14_gondola)	C++20	20 / 100	4 ms	1216 KiB

gondola

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

int valid(int n, int inputSeq[])
{
    vector<int> a;
    for (int i = 0; i < n; ++i) {
        a.push_back(inputSeq[i]);
    }
    int flag = 1;
    for (int i = 0; i < n; ++i) {
        int prev = (i - 1);
        if (i == 0) {
            prev = n - 1;
        }
        if ((a[i] == a[prev] + 1) || (a[prev] == n && a[i] == 1)) {
            continue;
        } else {
            flag = 0;
        }
    }
    return flag;
}

//----------------------

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

//----------------------

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

• 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