제출 #1176655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1176655		adkjt	Art Collections (BOI22_art)	C++20	100 / 100	769 ms	492 KiB

art

#include "art.h"
#include<bits/stdc++.h>
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
vector<int> order;
int ans[4444],dif[4444];
void solve(int N) {
    for(int i=1;i<=N;i++) order.push_back(i);
    int A,B;
    for(int i=1;i<=N;i++){
    dif[i]=publish(order);//,cout<<dif[i]<<'\n';
    int f=order[0];
    for(int i=0;i<N-1;i++)
        order[i]=order[i+1];
        order[N-1]=f;
    }
    for(int i=1;i<=N-1;i++)
       {
           //cout<<i<<' '<<(N-1)-((N-1)-(dif[i]-dif[i+1]))/2<<'\n';
           ans[(N-1)-((N-1)-(dif[i]-dif[i+1]))/2]=i;
       }
    ans[(N-1)-((N-1)-(dif[N]-dif[1]))/2]=N;
    for(int i=0;i<N;i++)
        order[i]=ans[i];//cout<<order[i]<<' ';
    answer(order);
}

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