Submission #805706

#TimeUsernameProblemLanguageResultExecution timeMemory
805706annabeth9680Intercastellar (JOI22_ho_t1)C++14
100 / 100
370 ms4028 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { int N; cin >> N; vector<pair<int,int>> ans; for(int i = 0;i<N;++i){ int x; cin >> x; int y = 1; while(x % 2 == 0){ x /= 2; y *= 2; } ans.push_back({y,x}); //cout << y << " " << x << "\n"; } //cout << ans[0].first << "\n"; int Q; cin >> Q; int i = 0; ll cur = 0; while(Q--){ ll x; cin >> x; while(i < N && cur+ans[i].first < x){ cur += ans[i].first; i++; } //cout << i-1 << " " << cur << "\n"; cout << ans[i].second << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...