Submission #1182918

#TimeUsernameProblemLanguageResultExecution timeMemory
1182918KindaGoodGamesArt Collections (BOI22_art)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h> #include "art.h" using namespace std; #define pii pair<int,int> void solve(int n){ vector<int> perm(n); iota(perm.begin(),perm.end(), 1); vector<pii> results; for(int i = 0; i < n; i++){ int ans = publish(perm); vector<int> nPerm(n); results.push_back({ans, i}); for(int j = 0; j < n; j++){ nPerm[(j+1)%n] = perm[j]; } perm = nPerm; //if(i < n-1) swap(perm[0], perm[i+1]); } sort(results.begin(), results.end()); vector<int> res(n); for(int i = 0; i < n; i++){ //cerr << results[i].first<<endl; res[i] = results[i].second+1; } answer(res); }
#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...