Submission #681440

#TimeUsernameProblemLanguageResultExecution timeMemory
681440coding_snorlaxIntercastellar (JOI22_ho_t1)C++14
100 / 100
490 ms9448 KiB
#include<bits/stdc++.h> using namespace std; long long int T,Count; vector<long long int> place; vector<long long int> prefix; int main(){ cin>>T; for(int i=1;i<=T;i++){ long long int tmp; cin>>tmp; Count = 1; while(!(tmp%2)){ tmp/=2; Count*=2; } place.push_back(tmp); if(prefix.empty()) prefix.push_back(Count); else prefix.push_back(prefix.back()+Count); } int Q; cin>>Q; long long int Find; for(int i=1;i<=Q;i++){ cin>>Find; int place_answer = lower_bound(prefix.begin(),prefix.end(),Find)-prefix.begin(); cout<<place[place_answer]<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...