Submission #551431

#TimeUsernameProblemLanguageResultExecution timeMemory
551431luka1234Intercastellar (JOI22_ho_t1)C++14
100 / 100
482 ms6976 KiB
#include<bits/stdc++.h> #define ll long long #define ff first #define ss second using namespace std; int n,q; ll a[200001]; vector<pair<ll,ll> > v; int main(){ cin>>n; for(int k=1;k<=n;k++){ cin>>a[k]; ll x=0,y=1; while(a[k]%2==0){ y*=2; a[k]/=2; } x=a[k]; v.push_back({y,x}); } cin>>q; ll sum=0; int ind=-1; while(q--){ ll f; cin>>f; while(sum<f){ ind++; sum+=v[ind].ff; } cout<<v[ind].ss<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...