Submission #1188887

#TimeUsernameProblemLanguageResultExecution timeMemory
1188887mareksbArt Collections (BOI22_art)C++17
100 / 100
766 ms496 KiB
#include "art.h" #include<bits/stdc++.h> #pragma GCC optimize ("O3,unroll-loops") #pragma GCC target ("avx2,bmi,bmi2,popcnt,lzcnt") using namespace std; // // --- Sample implementation for the task art --- // // To compile this program with the sample grader, place: // art.h art_sample.cpp sample_grader.cpp // in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory, // left click on "Open in terminal") and enter e.g.: // g++ -std=c++17 art_sample.cpp sample_grader.cpp // in this folder. This will create a file a.out in the current directory which you can execute from the terminal // as ./a.out // See task statement or sample_grader.cpp for the input specification // void solve(int N) { vector<int> ans; vector<int> a(N); for(int i=0;i<N;i++){ a[i]=i+1; } int prev=publish(a); int fin=prev; for(int i=0;i<N-1;i++){ rotate(a.begin(),a.begin()+1,a.end()); int next=publish(a); ans.push_back((prev-next+N+N%2)/2-(N%2)); prev=next; } ans.push_back((prev-fin+N+N%2)/2-(N%2)); vector<int> rans(N); for(int i=0;i<N;i++){ rans[ans[i]]=i+1; } //cout<<'\n'; answer(rans); } /* int publish(vector<int>); void answer(vector<int>); */
#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...