# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698402 | yeyso | Intercastellar (JOI22_ho_t1) | C++14 | 2055 ms | 12108 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;
int main(){
int n; cin >> n;
vector<vector<int>> pieces(n, vector<int>(0, 0));
int x;
int t = 0;
for(int i = 0; i < n; i ++){
cin >> x;
t = 1;
while(x % 2 == 0){
x /= 2;
t *= 2;
}
pieces[i] = {x, t};
}
//cout << "pieces";
/*for(int i = 0; i < n; i ++){
//for(int j = 0; j < pieces[i][1]; j ++){
cout << pieces[i][0] << " ";
//}
}*/
//cout << "\n";
vector<int> ps(n, 0);
ps[0] = pieces[0][1];
//cout << ps[0] << " ";
/*for(int i = 1; i < n; i ++){
ps[i] = ps[i-1] + pieces[i][1];
cout << ps[i] << " ";
}*/
int q; cin >> q;
int lf = 0;
for(int i = 0; i < q; i ++){
cin >> x;
for(int j = 0; j < n; j ++){
if(x <= ps[j]){
//cout << "SIZE: " << pieces[j][0] << "!\n";
cout << pieces[j][0] << "\n";
break;
}
}
// binary search for
}
}
/*
4
14
9
8
12
15
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
*/
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... |