제출 #1157277

#제출 시각아이디문제언어결과실행 시간메모리
1157277wjliangtpeIntercastellar (JOI22_ho_t1)C++20
100 / 100
46 ms5444 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define oo 10000000000000001 int n,a[200005],pre[200005],x,q; signed main(){ ios::sync_with_stdio(0),cin.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; int cnt=1; while(a[i]%2==0){ cnt*=2; a[i]/=2; } pre[i]=pre[i-1]+cnt; //cout<<pre[i]; } cin>>q; for(int i=1;i<=q;i++){ cin>>x; cout<<a[lower_bound(pre+1,pre+n+1,x)-pre]<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...