| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1157275 | wjliangtpe | Intercastellar (JOI22_ho_t1) | C++20 | 1 ms | 324 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
