# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
881950 | hennessey | Intercastellar (JOI22_ho_t1) | C++17 | 2055 ms | 6088 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
signed main() {
//your code goes here
int n;
cin >> n;
vector <pair <int, int>> arr = {};
for(int i = 0; i < n; i++) {
int num;
cin >> num;
int val = 1;
// cout << num << " b " << endl;
while(num%2 == 0) {
val *= 2;
num /= 2;
}
// cout << num << " v " << endl;
arr.push_back({num, val});
}
int q;
cin >> q;
for(int i = 0; i < q; i++) {
int x;
cin >> x;
int val = 0;
for(int i = 0; i < arr.size(); i++) {
val += arr[i].second;
if(val >= x) {
cout << arr[i].first << endl;
break;
}
}
}
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... |