Submission #1004827

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004827		u_suck_o	곤돌라 (IOI14_gondola)	C++17	10 / 100	6 ms	1232 KiB

gondola

#include "bits/stdc++.h"
#include "gondola.h"

int valid(int n, int inputSeq[])
{
    bool found = false;
    int diff = -1;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] > n) continue;
        if (!found) {
            found = true;
            diff = (inputSeq[i] - i + n) % n;
        } else {
            if ((inputSeq[i] - i + n) % n != diff)
                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