Submission #374384

#	Time	Username	Problem	Language	Result	Execution time	Memory
374384		Aryan_Raina	곤돌라 (IOI14_gondola)	C++14	10 / 100	17 ms	1132 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
int valid(int n, int a[]) {
     int rr = -1;
    for (int i = 0; i < n; i++) {
        if (a[i] <= n) {
            if (rr == -1) rr = i;
            if ((n + a[i] - a[rr]) % n != (n + i - rr) % n) return 0;
        }
    }
    return 1;
}

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

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: 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