제출 #1165879

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165879		MPG	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	51 ms	5448 KiB

Main

//#pragma GCC optomize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long       ll;
#define     max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
#define     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define     filE freopen("in.txt", "r", stdin);// freopen("out1.txt", "w", stdout); 
#define     endl '\n'
#define     md(a) (a % mod + mod) % mod
#define     pb push_back
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//cout << setprecision(5) << fixed << f;
//hash prime = 769


ll const maxn = 5e5 + 123;
ll const inf = 3e18;
ll const loG = 18; // 23
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 500;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}



ll n, q, ps[maxn], chi[maxn];

ll get(ll x){
    while (x % 2 == 0)
        x = x / 2;
    return x;
}


void Solve(){

cin >> n;
for (int i = 1; i < n + 1; i++){
    ll x; cin >> x;
    chi[i] = get(x);
    ps[i] = ps[i - 1] + x / chi[i]; 
    //cout << i << ' ' << ps[i] << endl;
}
cin >> q;
while (q--){
    ll x; cin >> x;
    ll l = 0, r = n; 
    while (r - l > 1){
        ll mid = (r + l) / 2;
        if (ps[mid] >= x)
            r = mid;
        else
            l = mid;
    }
    cout << chi[r] << endl;
}



}



int main(){
sariE;
//filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40