Submission #1296897

#TimeUsernameProblemLanguageResultExecution timeMemory
12968971zaid1Art Collections (BOI22_art)C++17
100 / 100
683 ms520 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; const int M = 1e4+4; void solve(int n) { vector<pair<int, int>> ans; vector<int> v, x; for (int i = 1; i <= n; i++) v.push_back(i); for (int i = 1; i <= n; i++) { x.push_back(publish(v)); v.push_back(v[0]); v.erase(v.begin()); } for (int i = 0; i < n; i++) ans.push_back({x[(i+1)%n]-x[i], i}); sort(ans.rbegin(), ans.rend()); vector<int> v2; for (auto [a, b]:ans) v2.push_back(b+1); answer(v2); }
#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...