제출 #1291128

#제출 시각아이디문제언어결과실행 시간메모리
1291128hahaIntercastellar (JOI22_ho_t1)C++20
100 / 100
52 ms5340 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=2e5+5;

int n,q;
ll a[maxn],sum[maxn];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++){
        int tmp=a[i];
        while(tmp%2==0){
            tmp/=2;
        }
        sum[i]=sum[i-1]+(a[i]/tmp);
        a[i]=tmp;
    }
    cin>>q;
    while(q--){
        ll x;
        cin>>x;
        int pos=lower_bound(sum+1,sum+n+1,x)-sum;
        cout<<a[pos]<<'\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...