Submission #1205474

#	Time	Username	Problem	Language	Result	Execution time	Memory
1205474		mehralii	Rack (eJOI19_rack)	C++20	40 / 100	1095 ms	16708 KiB

rack

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define MAXN 1000005
#define LOG (int)log2(MAXN)+1

const int INF = 1e18;
const int MOD = 998244353;
const double EPS = 1e-8;

/*
	EJOI 2019 Day 1 problem B, 20p.
	Author: Mehrali Musabaliyev
*/

int n, k, cnt = 0;
vector<int> t;

void iter(int x, int lx, int rx){
	if(rx-lx==1){
		t[x] = 1;
		cnt++;
		if(cnt==k){
			cout << rx << '\n';
		}
		return;
	}
	int m = (lx+rx)/2;
	if(t[2*x+1]==t[2*x+2]){
		iter(2*x+1, lx, m);
	} else if(t[2*x+1]>t[2*x+2]){
		iter(2*x+2, m, rx);
	}
	t[x] = t[2*x+1]+t[2*x+2];
}

void solve(){
	cin >> n >> k;
	t.assign((1<<(n+1)) - 1, 0);
	for(int i = 0; i < k; i++) iter(0, 0, (1<<n));
}

signed main() {
    ios_base::sync_with_stdio(0);  cin.tie(0);  cout.tie(0);
    int t = 1;
    //cin >> t;
	for(int i = 1; i <= t; i++){
		//cout << "Case " << i << ": ";
		solve();
	}
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 60