# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545587 | aryan12 | Intercastellar (JOI22_ho_t1) | C++17 | 87 ms | 10892 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
void Solve() {
int n;
cin >> n;
vector<int> a(n + 1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<pair<int, int> > final;
for(int i = 1; i <= n; i++) {
int cnt = 1;
while(a[i] % 2 == 0) {
a[i] /= 2;
cnt *= 2;
}
final.push_back(make_pair(a[i], cnt));
}
for(int i = 1; i < final.size(); i++) {
final[i].second += final[i - 1].second;
}
int q;
cin >> q;
while(q--) {
int x;
cin >> x;
int l = 0, r = final.size() - 1;
int ans = r;
while(l <= r) {
int mid = (l + r) / 2;
if(final[mid].second >= x) {
ans = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
cout << final[ans].first << "\n";
}
}
int32_t main() {
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) {
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |