Submission #1014712

#TimeUsernameProblemLanguageResultExecution timeMemory
1014712snpmrnhlolIntercastellar (JOI22_ho_t1)C++17
100 / 100
336 ms7748 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2e5;
ll v[N];
int main(){
    ll n,q;
    ll pt = 0,pt2 = 0;
    ll tmp = -1;
    cin>>n;
    for(ll i = 0;i < n;i++){
        cin>>v[i];
    }
    cin>>q;
    for(ll i = 0;i < q;i++){
        ll x;
        cin>>x;
        while(pt2 < n && pt < x){
            ///include next number
            ll cnt = 1,nr2 = v[pt2];
            while(nr2%2 == 0){
                nr2/=2;
                cnt*=2;
            }
            pt+=cnt;
            tmp = nr2;
            pt2++;
        }
        cout<<tmp<<'\n';
    }
    return 0;
}
/**
4
14 9 8 12
6
2 3 5 7 11 13
**/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...