제출 #316167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316167		qpwoeirut	곤돌라 (IOI14_gondola)	C++17	20 / 100	396 ms	1912 KiB

gondola

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

using namespace std;

const int MN = 250001;

bool seen[MN];
int valid(int n, int inputSeq[]) {
    for (int i=0; i<n; ++i) {
        if (inputSeq[i] <= n) {
            int val = inputSeq[i];
            int idx = (n + i - val + 1) % n;
            rotate(inputSeq, inputSeq+idx, inputSeq+n);
            break;
        }
    }
    for (int i=0; i<n; ++i) { cerr << inputSeq[i] << ' '; } cerr << endl;

    for (int i=0; i<n; ++i) {
        if (inputSeq[i] != i+1 && inputSeq[i] <= n) {
            return 0;
        }
        if (seen[inputSeq[i]]) {
            return 0;
        }
        seen[inputSeq[i]] = true;
    }

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