제출 #1166024

#제출 시각아이디문제언어결과실행 시간메모리
1166024novemnotesIntercastellar (JOI22_ho_t1)C++20
25 / 100
36 ms5052 KiB
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>

int n,q;
vector<pii> tmp,pref;

void solve(int x,int cnt){
	if(x%2==1)tmp.push_back({x,cnt});
	else solve(x/2,cnt*2);
}

int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin >> n;
	for(int i=0;i<n;i++){
		int x;cin >> x;
		solve(x,1);
	}
	pref.push_back({0,0});
	for(int i=0;i<n;i++){
		pref.push_back({tmp[i].second + pref[i].first,tmp[i].first});
	}
	cin >> q;
	while(q--){
		int a;cin >> a;
		pii target = {a,INT_MIN};
		auto it = lower_bound(pref.begin(),pref.end(),target) - pref.begin();
		cout << pref[it].second << "\n";
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...