제출 #734896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734896		sandry24	곤돌라 (IOI14_gondola)	C++17	25 / 100	13 ms	1492 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int freq[250001];

int valid(int n, int inputSeq[]){
    int index_under_n = -1;
    for(int i = 0; i < n; i++){
        freq[inputSeq[i]]++;
        if(freq[inputSeq[i]] > 1)
            return 0;
        if(inputSeq[i] <= n)
            index_under_n = i;
    }
    if(index_under_n == -1)
        return 1;
    int index = (index_under_n == n-1 ? 0 : index_under_n + 1);
    int next = (inputSeq[index_under_n] == n ? 1 : inputSeq[index_under_n] + 1);
    while(index != index_under_n){
        if(inputSeq[index] < n){
            if(inputSeq[index] != next){
                return 0;
            }
        }
        index = (index == n-1 ? 0 : index + 1);
        next = (next == n ? 1 : next + 1);
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return 1;
}
int countReplacement(int n, int inputSeq[]){
    return 1;
}

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10