#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
* graph approach
* dp
* dividing the problem to smaller statements
* finding the real constraint
* sqrt decomposition
* greedy approach
* pigeonhole principle
* rewriting the problem/equality
* bitwise approaches
* binary search if monotonic
* divide and conquer
* combinatorics
* inclusion - exclusion
* think like bfs
*/
inline int in()
{
int x;cin >> x;
return x;
}
inline string in2()
{
string x;cin >> x;
return x;
}
void solve()
{
int n=in();
int arr[n+1];
for(int i=1;i<=n;i++) arr[i]=in();
vector<pii> v;
for(int i=1;i<=n;i++)
{
int cur=arr[i];
while(cur%2==0) cur/=2;
v.pb({cur,arr[i]/cur});
}
for(int i=1;i<sz(v);i++) v[i].ss+=v[i-1].ss;
int q=in();
while(q--)
{
int x=in();
int l=0,r=sz(v);
while(l<r)
{
int mi=(l+r)/2;
if(v[mi].ss<x) l=mi+1;
else r=mi;
}
cout << v[l].ff << endl;
}
}
int32_t main(){
cin.tie(0); ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t=1;//cin>> t;
for(int i=1;i<=t;i++)
{
// cout << "Case #" << i << ": ";
solve();
}
return 0;
}
Compilation message
Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
2 | #pragma optimize ("Bismillahirrahmanirrahim")
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
316 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
22 ms |
6592 KB |
Output is correct |
4 |
Correct |
31 ms |
2768 KB |
Output is correct |
5 |
Correct |
58 ms |
7220 KB |
Output is correct |
6 |
Correct |
39 ms |
6332 KB |
Output is correct |
7 |
Correct |
52 ms |
7208 KB |
Output is correct |
8 |
Correct |
55 ms |
7272 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
320 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 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 |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
328 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
316 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
22 ms |
6592 KB |
Output is correct |
4 |
Correct |
31 ms |
2768 KB |
Output is correct |
5 |
Correct |
58 ms |
7220 KB |
Output is correct |
6 |
Correct |
39 ms |
6332 KB |
Output is correct |
7 |
Correct |
52 ms |
7208 KB |
Output is correct |
8 |
Correct |
55 ms |
7272 KB |
Output is correct |
9 |
Correct |
1 ms |
320 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 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 |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
328 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
29 ms |
3396 KB |
Output is correct |
24 |
Correct |
36 ms |
7144 KB |
Output is correct |
25 |
Correct |
71 ms |
10416 KB |
Output is correct |
26 |
Correct |
50 ms |
6716 KB |
Output is correct |
27 |
Correct |
44 ms |
7292 KB |
Output is correct |
28 |
Correct |
83 ms |
10912 KB |
Output is correct |
29 |
Correct |
83 ms |
10292 KB |
Output is correct |
30 |
Correct |
41 ms |
4064 KB |
Output is correct |
31 |
Correct |
79 ms |
10796 KB |
Output is correct |