Submission #1229228

#TimeUsernameProblemLanguageResultExecution timeMemory
1229228avighnaArt Collections (BOI22_art)C++20
70 / 100
760 ms508 KiB
#include <bits/stdc++.h>

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

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

void solve(int N) {
  std::vector<int> front(N + 1), back(N + 1);
  for (int i = 1; i <= N; ++i) {
    std::vector<int> a;
    for (int j = 1; j <= N; ++j) {
      if (i != j) {
        a.push_back(j);
      }
    }
    a.push_back(i);
    back[i] = publish(a);
    a.pop_back();
    a.insert(a.begin(), i);
    front[i] = publish(a);
  }
  std::vector<int> ans;
  for (int i = 0; i < N; ++i) {
    for (int j = 1; j <= N; ++j) {
      if (back[j] - front[j] == N - 2 * i - 1) {
        ans.push_back(j);
      }
    }
  }
  answer(ans);
}
#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...