Submission #1235979

#TimeUsernameProblemLanguageResultExecution timeMemory
1235979jellybeanArt Collections (BOI22_art)C++20
100 / 100
765 ms508 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second #define dd(x) cout<<#x<<" is "<<x<<endl; #define dd2(x,y) cout<<#x<<" is "<<x<<" "<<#y<<" is "<<y<<endl; typedef pair<int,int> pii; deque<int>d; int n, ans[4005]; void query(){ for(int i=1; i<=n; i++) d.pb(i); for(int i=1; i<=n; i++){ vector<int>v; for(int i=0; i<n; i++) v.pb(d[i]); ans[i] = publish(v); d.push_back(i); d.pop_front(); } ans[n+1] = ans[1]; } void solve(int N) { n=N; query(); vector<int>res(n); for(int i=1; i<=n; i++){ int dif = ans[i+1]-ans[i]; int pos = (n-1-dif)/2; res[pos] = i; } 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...