제출 #536737

#제출 시각아이디문제언어결과실행 시간메모리
536737xp875Intercastellar (JOI22_ho_t1)C++17
25 / 100
43 ms3280 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	int n, q;
	cin >> n;
	int a[n];
	for(int i=0; i<n; i++) cin >> a[i];
	
	vector<pair<int, int> > v;
	for(int i=0; i<n; i++) {
		int x = a[i], count = 0;
		while(x%2==0) {
			x/=2; 
			count++;
		}
		v.push_back(make_pair(x, 1<<count));
	}
	cin >> q;
	int i = 0, count = 0;
	while(q--) {
		int x;
		cin >> x;
		while(count+v[i].second < x) {
			count += v[i].second;
			i++;
		}
		cout << v[i].first << '\n';
	}
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...