제출 #890463

#제출 시각아이디문제언어결과실행 시간메모리
890463irmuunIntercastellar (JOI22_ho_t1)C++17
100 / 100
58 ms10844 KiB
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    vector<pair<ll,ll>>a(n);
    vector<ll>tot(n);
    ll cur=0;
    for(ll i=0;i<n;i++){
        cin>>a[i].ff;
        a[i].ss=1;
        while(a[i].ff%2==0){
            a[i].ff/=2;
            a[i].ss*=2;
        }
        cur+=a[i].ss;
        tot[i]=cur;
    }
    ll q;
    cin>>q;
    while(q--){
        ll x;
        cin>>x;
        ll y=lower_bound(all(tot),x)-tot.begin();
        cout<<a[y].ff<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...