제출 #914713

#제출 시각아이디문제언어결과실행 시간메모리
914713elotelo966Intercastellar (JOI22_ho_t1)C++17
100 / 100
60 ms9296 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define OYY 1000000005 #define mod 998244353 #define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define mid (start+end)/2 #define lim 200005 #define se second #define fi first int dizi[lim]; int32_t main(){ faster int n;cin>>n; vector<int> cev(n,0); for(int i=0;i<n;i++){ cin>>dizi[i]; while((dizi[i]%2)==0){ cev[i]++; dizi[i]/=2; } cev[i]=(1<<cev[i]); if(i!=0)cev[i]+=cev[i-1]; } //for(int i=0;i<n;i++)cout<<cev[i]<<" "; int q;cin>>q; while(q--){ int x;cin>>x; int deg=lower_bound(cev.begin(),cev.end(),x)-cev.begin(); cout<<dizi[deg]<<'\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...