제출 #398488

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398488		model_code	The Collection Game (BOI21_swaps)	C++17	100 / 100	8 ms	388 KiB

swaps

#include "swaps.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> r;
vector<pair<int, int>> queries;

void scheduleSortingNetwork(int i, int j) {
  schedule(r[i], r[j]);
  queries.emplace_back(i, j);
}

void visitSortingNetwork() {
  if (queries.size() == 0)
    return;
  vector<int> res = visit();
  for (int i = 0; i < (int) res.size(); i++)
    if (!res[i])
      swap(r[queries[i].first], r[queries[i].second]);
  queries.clear();
}

void answerSortingNetwork() {
  answer(r);
}

void solve(int N, int Q) {
  for (int i = 1; i <= N; i++)
    r.push_back(i);
  for (int k = 2; k <= 2 * N; k <<= 1) {
    for (int i = 0; i < N; i++) {
      int l = i ^ (k - 1);
      if (i < l && l < N)
        scheduleSortingNetwork(i, l);
    }
    visitSortingNetwork();
    for (int j = k >> 2; j > 0; j >>= 1) {
      for (int i = 0; i < N; i++) {
        int l = i ^ j;
        if (i < l && l < N)
          scheduleSortingNetwork(i, l);
      }
      visitSortingNetwork();
    }
  }
  answerSortingNetwork();
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 3 / 3
• Subtask 4: 2 / 2
• Subtask 5: 9 / 9
• Subtask 6: 6 / 6
• Subtask 7: 9 / 9
• Subtask 8: 6 / 6
• Subtask 9: 21 / 21
• Subtask 10: 14 / 14
• Subtask 11: 9 / 9
• Subtask 12: 6 / 6