# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033615 | nguyendinhanh1508 | Intercastellar (JOI22_ho_t1) | C++14 | 68 ms | 10724 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
#define mx 1000007
#define inf LLONG_MAX/20
#define pi pair<int, int>
#define mp make_pair
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
int pos[n];
int val[n];
int cur = 0;
for(int i = 0; i < n; i++){
int curbit = 0;
while((a[i] & (1 << curbit)) == 0){
curbit++;
}
val[i] = a[i] / (1 << curbit);
pos[i] = cur;
cur += (1 << curbit);
}
// for(int i = 0; i < n; i++){
// cerr << pos[i] << ' ' << val[i] << '\n';
// }
int arrsize = cur;
// cerr << arrsize << '\n';
int q;
cin >> q;
while(q--){
int x;
cin >> x;
x--;
// cerr << x << '\n';
int l = 0, r = n - 1;
int ans = 0;
while(l <= r){
int mid = (l + r) / 2;
if(pos[mid] <= x){
l = mid + 1;
ans = val[mid];
} else r = mid - 1;
}
cout << ans << '\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... |