#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
ll arr[n];
f(i,0,n){
cin>>arr[i];
}
ll q;
cin>>q;
ll cur = 0;
ll pos = -1;
while(q--){
ll x;
cin>>x;
while(cur < x){
pos++;
ll posa = 1;
while(arr[pos] % 2 == 0){
arr[pos] /= 2;
posa *= 2;
}
cur += posa;
}
cout<<arr[pos]<<"\n";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
14 ms |
2444 KB |
Output is correct |
| 4 |
Correct |
21 ms |
1964 KB |
Output is correct |
| 5 |
Correct |
35 ms |
3936 KB |
Output is correct |
| 6 |
Correct |
20 ms |
2760 KB |
Output is correct |
| 7 |
Correct |
38 ms |
3976 KB |
Output is correct |
| 8 |
Correct |
35 ms |
4044 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
324 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
324 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
14 ms |
2444 KB |
Output is correct |
| 4 |
Correct |
21 ms |
1964 KB |
Output is correct |
| 5 |
Correct |
35 ms |
3936 KB |
Output is correct |
| 6 |
Correct |
20 ms |
2760 KB |
Output is correct |
| 7 |
Correct |
38 ms |
3976 KB |
Output is correct |
| 8 |
Correct |
35 ms |
4044 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
324 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
0 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
212 KB |
Output is correct |
| 18 |
Correct |
1 ms |
324 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
0 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
20 ms |
2712 KB |
Output is correct |
| 24 |
Correct |
25 ms |
4088 KB |
Output is correct |
| 25 |
Correct |
47 ms |
7232 KB |
Output is correct |
| 26 |
Correct |
31 ms |
4484 KB |
Output is correct |
| 27 |
Correct |
30 ms |
4368 KB |
Output is correct |
| 28 |
Correct |
56 ms |
7660 KB |
Output is correct |
| 29 |
Correct |
54 ms |
7100 KB |
Output is correct |
| 30 |
Correct |
28 ms |
3436 KB |
Output is correct |
| 31 |
Correct |
64 ms |
7552 KB |
Output is correct |
