Submission #1220954

#TimeUsernameProblemLanguageResultExecution timeMemory
1220954boclobanchatIntercastellar (JOI22_ho_t1)C++20
100 / 100
52 ms5444 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=2e5+5; long long pref[MAXN],val[MAXN]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,q; cin>>n; for(int i=1;i<=n;i++) { cin>>val[i]; pref[i]=1; while(val[i]%2==0) val[i]/=2,pref[i]*=2; pref[i]+=pref[i-1]; } cin>>q; while(q--) { long long res; cin>>res; cout<<val[lower_bound(pref+1,pref+n+1,res)-pref]<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...