제출 #928566

#제출 시각아이디문제언어결과실행 시간메모리
928566jcelinIntercastellar (JOI22_ho_t1)C++14
100 / 100
65 ms9924 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<pll> vpll;

#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define all(x) (x).begin(), (x).end()

const int mod = 1e9 + 7; //998244353;
const int inf = 1e9 + 7;
const ll INF = 1e18 + 7;
const int logo = 20;
const int MAXN = 1e6 + 7;
const int off = 1 << logo;
const int trsz = off << 1;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};

vpll niz;

void solve(){
	int n;
	cin >> n;
	
	ll cs = 0;
	for(int i=0; i<n; i++){
		ll x, y;
		cin >> x;
		y = x;
		while(y % 2 == 0) y /= 2;
		cs += x / y;
		niz.PB({y, cs});
	}
	int q;
	cin >> q;
	
	int cans = 0;
	while(q--){
		ll x;
		cin >> x;
		while(niz[cans].Y < x) cans++;
		
		cout << niz[cans].X << "\n";
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...