Submission #923727

#TimeUsernameProblemLanguageResultExecution timeMemory
923727AmrIntercastellar (JOI22_ho_t1)C++14
100 / 100
60 ms10452 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define S second #define F first #define all(x) (x).begin(),(x).end() #define sz size() #define Yes cout << "YES" << endl #define No cout << "NO" << endl #define pb(x) push_back(x); #define endl '\n' #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const int N=3e5+7; ll INF=INT_MAX,mod=1e9+7; int TT=1; ll power(ll x, unsigned int y) { ll res = 1; x = x; // % mod; if (x == 0) return 0; while (y > 0) { if (y & 1) res = (res*x) ; // % mod; y = y>>1; x = (x*x) ; // % mod; } return res; } ll n; pair<ll,ll> a[N]; void solve() { cin >> n; for(int i = 1; i <= n; i++) cin >> a[i].F; for(int i = 1; i <= n; i++) { ll cnt = 1; while(a[i].F%2==0) {cnt*=2; a[i].F/=2;} a[i].S = cnt + a[i-1].S; } // for(int i = 1; i <= n ;i++) cout << a[i].S << " "; cout << endl; ll q; cin >> q; while(q--){ ll x; cin >> x; ll l = 0, r = n; while(l+1<r) { ll mid = (l+r)/2; if(a[mid].S<x) l= mid; else r = mid; } cout << a[r].F << endl; } } int main(){ //freopen("friday.in","r",stdin); //freopen("friday.out","w" ,stdout); fast; while(TT--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...