Submission #749911

#	Time	Username	Problem	Language	Result	Execution time	Memory
749911		Abrar_Al_Samit	곤돌라 (IOI14_gondola)	C++17	20 / 100	9 ms	1864 KiB

gondola

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

using namespace std;

const int nax = 1e5 + 3;

int cnt[nax];
int valid(int n, int inputSeq[]) {
    for(int i=0; i<n; ++i) {
        cnt[inputSeq[i]]++;
        if(cnt[inputSeq[i]]>1) {
            return 0;
        }
    }

    int min_at = min_element(inputSeq, inputSeq+n) - inputSeq;

    int expected[n] = {0};
    int cur_val = inputSeq[min_at];
    int cur_id = min_at;

    for(int i=cur_id; ; ++i, ++cur_val) {
        if(i==n) i = 0;
        if(cur_val>n) cur_val = 1;

        if(expected[i]) break;

        expected[i] = cur_val;
    }

    for(int i=0; i<n; ++i) if(inputSeq[i]<=n) {
        if(inputSeq[i]!=expected[i]) 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: 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