# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936128 | weakweakweak | Intercastellar (JOI22_ho_t1) | C++14 | 68 ms | 12628 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 ll long long
ll a[310000] = {0}, cnt[310000] = {0}, pre[310000] = {0};
int main () {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, q, x;
vector <int> v;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
cnt[i] = 1;
while (a[i] % 2 == 0) {
a[i] >>= 1;
cnt[i] <<= 1;
}
}
for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + cnt[i];
ll y;
cin >> q;
while (q--) {
cin >> y;
int ii = lower_bound(pre + 1, pre + 1 + n, y) - pre;
cout << a[ii] << '\n';
}
}
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... |