# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783225 | thimote75 | Intercastellar (JOI22_ho_t1) | C++14 | 368 ms | 9208 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>
#define int long long
using namespace std;
using idata = vector<int>;
void cumul (idata &a) {
for (int i = 1; i < a.size(); i ++)
a[i] += a[i - 1];
}
int bs (idata &arr, int t) {
int a = -1;
int b = arr.size();
while (b - a > 1) {
int c = (a + b) >> 1;
if (arr[c] >= t) b = c;
else a = c;
}
return b;
}
signed main () {
int N;
cin >> N;
idata sizes (N);
idata values(N);
for (int i = 0; i < N; i ++) {
int x; cin >> x;
int count = 1;
while ((x & 1) == 0) {
count *= 2;
x >>= 1;
}
sizes [i] = count;
values[i] = x;
}
cumul(sizes);
int Q;
cin >> Q;
for (int i = 0; i < Q; i ++) {
int x;
cin >> x;
int r = bs(sizes, x);
cout << values[r] << "\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... |