제출 #1179639

#제출 시각아이디문제언어결과실행 시간메모리
1179639user736482Intercastellar (JOI22_ho_t1)C++20
100 / 100
55 ms5444 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define ff first #define ss second #define MOD 1000000009 #define INF 1000000019 #define INFL 1000000000000000099LL ll n,q,s,t,a,b,c,ans=INFL,k,m; ll co[1000007],co2[1000007]; int main() { ios_base::sync_with_stdio(0);cin.tie(0); cin>>n; for(ll i=1;i<=n;i++){ cin>>a; ll pom=1; while(a%(pom*2)==0)pom*=2; co[i]=pom+co[i-1]; co2[i-1]=a/pom; } cin>>q; for(ll i=0;i<q;i++){ cin>>a; ll pocz=1; ll kon=n; while(pocz!=kon){ ll mid=(pocz+kon)/2; if(co[mid]>=a) kon=mid; else pocz=mid+1; } cout<<co2[pocz-1]<<"\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...