oj.uz

Submission #582576

# Submission time Handle Problem Language Result Execution time Memory
582576 2022-06-24T06:13:07 Z Plurm Permutation (APIO22_perm) C++17
91.3333 / 100
 2 ms 348 KB 
#include "perm.h"
#include <algorithm>
#include <iostream>
 
class intperm {
public:
  std::vector<int> perm;
  long long value;
  intperm(std::vector<int> perm = {}, long long value = 1)
      : perm(perm), value(value) {}
  std::pair<int, int> get_bounds() {
    return std::make_pair(*min_element(perm.begin(), perm.end()),
                          *max_element(perm.begin(), perm.end()));
  }
  friend bool operator<(const intperm &a, const intperm &b) {
    return a.value < b.value;
  }
  friend intperm operator+(intperm a, intperm b) {
    intperm nxt;
    if (b < a) {
      std::swap(a.perm, b.perm);
      std::swap(a.value, b.value);
    }
    nxt.perm = b.perm;
    int offs = (a.perm.empty() ? 0 : a.get_bounds().second + 1);
    for (int &x : nxt.perm)
      x += offs;
    nxt.perm.insert(nxt.perm.end(), a.perm.begin(), a.perm.end());
    nxt.value = a.value + b.value - 1;
    return nxt;
  }
  friend intperm operator*(intperm a, intperm b) {
    intperm nxt;
    if (b < a) {
      std::swap(a.perm, b.perm);
      std::swap(a.value, b.value);
    }
    nxt.perm = b.perm;
    int offs = (a.perm.empty() ? 0 : a.get_bounds().second + 1);
    for (int &x : nxt.perm)
      x += offs;
    nxt.perm.insert(nxt.perm.begin(), a.perm.begin(), a.perm.end());
    nxt.value = a.value * b.value;
    return nxt;
  }
};
 
const intperm ONE({}, 1);
const intperm TWO({0}, 2);
const intperm THREE({1,0}, 3);
const intperm FOUR({0,1}, 4);
std::vector<int> construct_permutation(long long k) {
  intperm ans;
  int msb = 63 - __builtin_clzll(k);
  msb = (msb / 2 + 1) * 2;
  switch ((k & (3ll << (msb - 2ll))) >> (msb - 2ll)) {
    case 1ll:
      ans = ONE;
      break;
    case 2ll:
      ans = TWO;
      break;
    case 3ll:
      ans = THREE;
      break;
  }
  for (long long i = msb - 4; i >= 0; i -= 2) {
    ans = ans * FOUR;
    switch ((k & (3ll << i)) >> i) {
      case 1ll:
        ans = ans + TWO;
        break;
      case 2ll:
        ans = ans + THREE;
        break;
      case 3ll:
        ans = ans + FOUR;
        break;
    }
  }
  return ans.perm;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
81.333333333 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Partially correct 2 ms 340 KB Partially correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Partially correct 2 ms 340 KB Partially correct
9 Correct 2 ms 348 KB Output is correct
10 Partially correct 2 ms 340 KB Partially correct
11 Partially correct 2 ms 340 KB Partially correct
12 Partially correct 2 ms 340 KB Partially correct
13 Partially correct 2 ms 340 KB Partially correct