제출 #278071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
278071		petar_vitorac	Rack (eJOI19_rack)	C++11	40 / 100	4 ms	4480 KiB

rack

#include<bits/stdc++.h>
using namespace std;

#define int long long

class ConstSizeVector {
	public:
		ConstSizeVector(int size) : v(size), totalsize(size) {}
		
		void pb(int n) {
			v[currsize] = n;
			currsize++;
		}
		
		int get(int i) {
			return v[i];
		}
		
		int getSize() {
			return currsize;
		}
		
	private:
		vector<int> v;
		int totalsize;
		int currsize = 0;
};

int mypow(int base, int exp) {
	int result = 1;
	
	for(int i = 1; i <= exp; i++) {
		result*=base;
	}
	
	return result;
}

signed main() {
	int n, k; cin >> n >> k;
	
	int totalOps = mypow(2, n);
	int tosubtractatend = 0;
	
	ConstSizeVector reversedOps (totalOps/2);
	
	if(k <= totalOps/2) {
		k+=totalOps/2;
		tosubtractatend = 1;		
	}
	

	
	reversedOps.pb(totalOps);
	while(totalOps - reversedOps.getSize() >= k) {
		int sizebefore = reversedOps.getSize();
		int tosubtract = totalOps/2/sizebefore;
		for(int i = 0; i < sizebefore; i++) {
			reversedOps.pb(reversedOps.get(i)-tosubtract);
		}
	}
	
	
	cout << reversedOps.get(totalOps/2 - (k-totalOps/2)) - tosubtractatend << "\n";
}

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