Submission #1229145

#TimeUsernameProblemLanguageResultExecution timeMemory
1229145avighnaArt Collections (BOI22_art)C++20
20 / 100
54 ms412 KiB
#include <bits/stdc++.h>

int publish(std::vector<int>);

void answer(std::vector<int>);

void solve(int N) {
  std::vector<int> p(N);
  std::iota(p.begin(), p.end(), 1);
  for (int i = 0; i < N; ++i) {
    int prev = publish(p);
    for (int j = 0; j < N - i - 1; ++j) {
      int e = p[i];
      p.erase(p.begin() + i);
      p.push_back(e);
      int cur = publish(p);
      if (cur - prev == N - i - 1) {
        p.pop_back();
        p.insert(p.begin() + i, e);
        break;
      }
      prev = cur;
    }
  }
  answer(p);
}
#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...