oj.uz

Submission #1112006

# Submission time Handle Problem Language Result Execution time Memory
1112006 2024-11-13T13:52:26 Z vjudge1 Rack (eJOI19_rack) C++17
40 / 100
 1 ms 508 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int t,n,a,b,cevap,k,pw[1000005];

inline int add(int x,int y){
	if(x+y>=1000000007)return x+y-1000000007;
	return x+y;
}

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>k;
	pw[0]=1;
	for(int i=1;i<=n;i++){
		pw[i]=add(pw[i-1],pw[i-1]);
	}
	cevap=1;
	int us=n-1;
	while(k!=1){
		if(k%2==0)cevap+=pw[us];
		us--;
		k=(k+1)/2;
	}
	cout<<cevap<<endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Incorrect 1 ms 508 KB Output isn't correct
12 Halted 0 ms 0 KB -