| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1291128 | haha | Intercastellar (JOI22_ho_t1) | C++20 | 52 ms | 5340 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=2e5+5;
int n,q;
ll a[maxn],sum[maxn];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
int tmp=a[i];
while(tmp%2==0){
tmp/=2;
}
sum[i]=sum[i-1]+(a[i]/tmp);
a[i]=tmp;
}
cin>>q;
while(q--){
ll x;
cin>>x;
int pos=lower_bound(sum+1,sum+n+1,x)-sum;
cout<<a[pos]<<'\n';
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
