Submission #815158

#TimeUsernameProblemLanguageResultExecution timeMemory
815158MohamedAhmed04Intercastellar (JOI22_ho_t1)C++14
100 / 100
67 ms9956 KiB
#include <bits/stdc++.h> using namespace std ; const int MAX = 2e5 + 10 ; int arr[MAX] ; int n , q ; long long cnt[MAX] , pref[MAX] ; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cin>>n ; for(int i = 1 ; i <= n ; ++i) cin>>arr[i] ; for(int i = 1 ; i <= n ; ++i) { cnt[i] = 1 ; while(arr[i] % 2 == 0) arr[i] /= 2 , cnt[i] *= 2 ; pref[i] = pref[i-1] + cnt[i] ; } cin>>q ; while(q--) { long long x ; cin>>x ; int idx = lower_bound(pref+1 , pref+n+1 , x) - pref ; cout<<arr[idx]<<"\n" ; } return 0 ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...