답안 #776395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776395	2023-07-07T19:51:23 Z	Tkm_algo	Rack (eJOI19_rack)	C++17	40 / 100	122 ms	16788 KB

rack

#include "bits/stdc++.h"

using namespace std;
using ll = long long;

vector<int> vis, ans;
int tt;

void rec(int x, int lx, int rx) {
	if (rx - lx == 1) {
		ans.push_back(rx);
		return;
	}
	int md = (lx + rx) / 2;
	if (vis[x] == 0) {
		rec(2 * x + 1, lx, md);
	} else {
		rec(2 * x + 2, md, rx);
	}
	vis[x] = (vis[x] + 1) % 2;
}

void solve() {
	int n, k;
	cin >> n >> k;
	n = pow(2, n);
	vis.assign(2 * n + 1, 0);
	rec(0, 0, n);
	for (int i = 0; i < n; i++) {
		rec(0, 0, n);
	}
	cout << ans[k - 1] << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int test = 1;
	// cin >> test;
	
	while (test--) {
		solve();
	}
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	6 ms	1496 KB	Output is correct
9	Correct	27 ms	4544 KB	Output is correct
10	Correct	122 ms	16788 KB	Output is correct

Subtask #3

0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	6 ms	1496 KB	Output is correct
9	Correct	27 ms	4544 KB	Output is correct
10	Correct	122 ms	16788 KB	Output is correct
11	Runtime error	1 ms	340 KB	Execution killed with signal 11
12	Halted	0 ms	0 KB	-