Submission #1157146

#TimeUsernameProblemLanguageResultExecution timeMemory
1157146the_ZHERArt Collections (BOI22_art)C++20
0 / 100
0 ms408 KiB
#include <bits/stdc++.h> #include "art.h" using namespace std; void solve(int N){ vector<int>ans; int pos[5000]; for(int i=1;i<=N;i++){ ans.push_back(i); pos[i]=i-1; } int was[5000]; for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ if(was[j]==1){ continue; } pos[ans[0]]=pos[j]; swap(ans[pos[j]],ans[0]); pos[j]=0; int x=publish(ans); if(x==N-i){ was[j]=1; pos[ans[0]]=N-i; pos[ans[N-i]]=0; swap(ans[0],ans[N-i]); break; } } } 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...