제출 #1324119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1324119		sh_qaxxorov_571	곤돌라 (IOI14_gondola)	C++20	25 / 100	24 ms	4608 KiB

gondola

#include "gondola.h"
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

// 1. Valid funksiyasi
int valid(int n, int inputSeq[]) {
    set<int> seen;
    int first_pos = -1;
    for (int i = 0; i < n; i++) {
        if (seen.count(inputSeq[i])) return 0; // Takroriy raqam
        seen.insert(inputSeq[i]);
        if (inputSeq[i] <= n) {
            // Boshlang'ich gondolaning o'rnini saqlaymiz
            int expected = (inputSeq[i] - 1 - i + n) % n;
            if (first_pos == -1) first_pos = expected;
            else if (first_pos != expected) return 0; // Tartib buzilgan
        }
    }
    return 1;
}

// 2. Replacement funksiyasi
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    // ... buzilgan gondolalarni tartiblab, zaxiradan asl raqamga o'tish yo'lini tiklash
    return 0; // Namuna uchun
}

// 3. CountReplacement funksiyasi
int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) return 0;
    // ... kombinatorika (nCr va darajaga ko'tarish) mantiqini qo'llash
    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