Submission #1236140

#TimeUsernameProblemLanguageResultExecution timeMemory
1236140lioowArt Collections (BOI22_art)C++20
100 / 100
781 ms484 KiB
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
//     art.h art_sample.cpp sample_grader.cpp
void solve(int N) {
    vector<int>order;
    int q[N+5];
    for(int i=1;i<=N;i++){
    	int n=N;
    	order.clear();
    	int nw=i;
    	while(n>0){
    		order.push_back(nw);
    		nw++;
    		if(nw>N) nw=1;
    		n--;
		}
    	q[i]=publish(order);
	}
	q[N+1]=q[1];
	vector<int>ans(N);
	for(int i=1;i<=N;i++){
		ans[(N-1+q[i]-q[i+1])/2]=i;
	}
	answer(ans);
}
	
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...