제출 #580266

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
580266	2022-06-20 23:26:58	angelo_torres	순열 (APIO22_perm)	C++17	100 / 100	2 ms	352 KiB

perm

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define f(i,j,n) for(ll i = j; i < n; ++i)
#define fr(i,j,n) for(ll i = j; i >= n; --i)
#define sz(v) (ll) v.size()
using namespace std;
typedef long long ll;
typedef vector<int> vi; 
typedef vector<ll> vll;
const int N = 4e3 + 20;
const ll mod = 1e9 + 7;
vi construct_permutation(ll k){
  ll aux = k, cn = 0;
  vll in[5];
  ll np[5];
  in[1] = {}, in[2] = {0}, in[3] = {1,0}; 
  np[1] = -1, np[2] = 0, np[3] = 1;
  while(aux >= 4) aux >>= 2, cn++;
  vll ans = in[aux];
  ll na = np[aux];
  fr(i,cn,1){
    ll j = (k>>(2*(i-1)))%4;
    if(j == 0){
      ans.push_back(++na);
      ans.push_back(++na);
    }
    if(j == 1){
      ans.push_back(++na);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 90 / 90