제출 #1171813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171813		Iskachun	Art Collections (BOI22_art)	C++20	100 / 100	831 ms	532 KiB

art

#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#include "art.h"/*
namespace {
    int N;
    int Q = 0;
    const int MAX_Q = 4000;
    const int MAX_N = 4000;
    vector<int> solution;
}
void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) {
    va_list args;
    va_start(args, msg);
    vfprintf(stdout, msg, args);
    fprintf(stdout, "\n");
    va_end(args);
    exit(0);
}
void __attribute__((noreturn)) answer(vector<int> R) {
    printf("answer({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);


    if(R == solution)
        result("Correct: %d published ranking(s).", Q);
    else
        result("Wrong answer!");
}
int publish(vector<int> R) {
    printf("publish({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);

    if (++Q > MAX_Q)
        result("Too many published rankings!");

    if (int(R.size()) != N)
        result("Invalid published ranking!");

    set<int> chosen;
    for(auto &x : R) {
        if(x < 1 || x > N || chosen.count(x))
            result("Invalid published ranking!");
        chosen.insert(x);
    }
    vector<int> positions(N+1);
    for(int i = 0; i < N; ++i)
        positions[R[i]] = i;

    int complaints = 0;
    for(int i = 0; i < N; ++i) {
        for(int j = i+1; j < N; ++j) {
            if(positions[solution[i]] > positions[solution[j]])
                ++complaints;
        }
    }

    return complaints;
}
*/
void solve (int n) {
    queue<int> q;
    for (int i = 1; i <= n; i++) q.push(i);
    int prev = 0;
    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        queue<int> z;
        vector<int> curr;
        while (q.size()) {
            curr.push_back(q.front()), z.push(q.front()), q.pop();
        }
        int x = publish(curr);
        q = z;
        if (i) ans[(n - 1 - x + prev) / 2] = i;
        prev = x;
        q.push(q.front()), q.pop();
    }
    for (int i = 0; i < n; i++) if (ans[i] == 0) ans[i] = n;
    answer(ans);
}
/*
int main() {
    //freopen("filename.in", "r", stdin), freopen("filename.out", "w", stdout);
    //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //int t = 1; //cin >> t;
    //while (t--) solve();
    if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N)
        result("Invalid input!");

    solution.resize(N);
    set<int> chosen;
    for(auto &x : solution) {
        if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x))
            result("Invalid input!");
        chosen.insert(x);
    }

    solve(N);

    result("No answer!");
}
*/

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30