제출 #569224

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
569224	2022-05-27 05:28:13	SSRS	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	100 / 100	593 ms	6632 KiB

lyuboyn

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>
using namespace std;
vector<int> solve(int N, int K, int t){
  if (K == N - 1){
    vector<int> ans(1 << N);
    ans[0] = t;
    for (int i = 1; i < (1 << N); i++){
      ans[i] = ans[i - 1] ^ ((1 << N) - 1);
      int p = __builtin_ctz(i);
      ans[i] ^= 1 << p;
    }
    return ans;
  } else {
    vector<int> P1 = solve(N - 1, K, t);
    int r = P1.back();
    int r2 = r ^ ((1 << (K - 1)) - 1);
    vector<int> P2 = solve(N - 1, K, r2);
    vector<int> P;
    for (int i = 0; i < (1 << (N - 1)); i++){
      P.push_back(P1[i]);
    }
    for (int i = 0; i < (1 << (N - 1)); i++){
      P.push_back(P2[i] ^ (1 << (N - 1)));
    }
    return P;
  }
}
int main(){
  int N, K, T;
  cin >> N >> K >> T;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 0
• Subtask 2: 5 / 5
• Subtask 3: 3 / 3
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 31 / 31
• Subtask 8: 17 / 17