제출 #1233626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1233626		kaltspielerhy	Unscrambling a Messy Bug (IOI16_messy)	C++20	20 / 100	1 ms	580 KiB

messy

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

int N;

void permutations(int l, int r) {
    if (l == r) return;
    
    int mid = (l+r)/2;

    string chaine(N, '0');
    for (int i = 0; i < l; i++) chaine[i] = '1';
    for (int i = r+1; i < N; i++) chaine[i] = '1';
    for (int i = l; i <= mid; i++) {
        chaine[i] = '1';
        add_element(chaine);
        // cout << chaine << '\n';
        chaine[i] = '0';
    }

    permutations(l, mid);
    permutations(mid+1, r);
}

void trouver(int l, int r, vector<int> objets, vector<int>& answer) {
    if (objets.size() == 1) {
        answer[l] = objets[0];
        return;
    }

    int mid = (l+r)/2;

    vector<int> gauche, droite;
    string chaine(N, '1');
    for (int i : objets) chaine[i] = '0';
    for (int i : objets) {
        chaine[i] = '1';
        // cerr << chaine << '\n';
        if (check_element(chaine)) {
            gauche.push_back(i);
        }
        else {
            droite.push_back(i);
        }
        chaine[i] = '0';
    }

    trouver(l, mid, gauche, answer);
    trouver(mid+1, r, droite, answer);
}

vector<int> restore_permutation(int n, int w, int r) {
    N = n;

    permutations(0, n-1);
    compile_set();

    vector<int> total;
    for (int i = 0; i < n; i++) {
        total.push_back(i);
    }

    vector<int> answer(n, -1);
    // cerr << "finished";
    trouver(0, n-1, total, answer);
    // cerr << "finished";

    return answer;
}

컴파일 시 표준 에러 (stderr) 메시지

messy.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
messy_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30