Submission #384809

#	Time	Username	Problem	Language	Result	Execution time	Memory
384809		angularAndSplintered	곤돌라 (IOI14_gondola)	C++14	20 / 100	12 ms	1132 KiB

gondola

#include "gondola.h"

int valid(int n, int inputSeq[])
{   
    auto nxt = [&] (int x) {
        if (x + 1 > n)
            return 1;
        return x + 1;
    };

    for (int i = 0; i < n; i += 1)
        if (inputSeq[(i + 1) % n] != nxt(inputSeq[i]))
          return false;
    return true;
}

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

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