Submission #1305786

#TimeUsernameProblemLanguageResultExecution timeMemory
1305786neonglitchArt Collections (BOI22_art)C++20
0 / 100
0 ms332 KiB
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n)
{
  vector<int> ans(n);
	vector<int> cur(n);
	iota(begin(cur),end(cur),1);
	int lst,ft,cr;
	lst=ft=publish(cur);
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<n;j++)swap(cur[j-1],cur[j]);
		if(cur.back()==n)cr=ft;
		else cr=publish(cur);
		int pos=(lst-cr+n-1)/2;
		ans[pos]=i;
	}
    answer(ans);
    return;
}
#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...