oj.uz

Submission #530560

# Submission time Handle Problem Language Result Execution time Memory
530560 2022-02-25T20:23:00 Z Monkey Rack (eJOI19_rack) C++14
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e6+7;
int wieszaki[MAXN];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n, akt=0;
	int potega=1, zasieg;
	int ile, ruch=0;
	int i;
	
	cin >> n >> ile;
	for(i=1; i<=n; ++i)
	{
		potega*=2;
	}
	
	zasieg=potega/2;
	++wieszaki[0];
	
	while(ruch<ile)
	{
		zasieg/=2;
		akt=0;
		while(akt<potega && ruch<ile)
		{
			akt+=zasieg;
			if(zasieg==1)
			{
				continue;
			}
			++wieszaki[akt];
			++ruch;
		}
	}
	++akt;
	cout << akt;
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -