Submission #624436

#TimeUsernameProblemLanguageResultExecution timeMemory
624436QwertyPiIntercastellar (JOI22_ho_t1)C++14
100 / 100
471 ms9196 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 2e5 + 13;
int l[N], x[N];
int32_t main(){
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		int v; cin >> v;
		int d = 0;
		while(v % 2 == 0) d++, v /= 2;
		l[i + 1] = 1LL << d;
		x[i + 1] = v;
	}
	for(int i = 0; i < n; i++){
		l[i + 1] += l[i];
	}
	int q;
	cin >> q;
	for(int i = 0; i < q; i++){
		int y;
		cin >> y;
		int idx = lower_bound(l, l + n + 1, y) - l;
		cout << x[idx] << endl;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...