| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332467 | Warinchai | Intercastellar (JOI22_ho_t1) | C++20 | 56 ms | 5560 KiB |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<int>v;
vector<int>sum;
int pos=0;
for(int i=1;i<=n;i++){
int a;cin>>a;
int cnt=0;
while(a%2==0){
a/=2;
cnt++;
}
v.push_back(a);
pos+=(1ll<<cnt);
sum.push_back(pos);
}
int q;cin>>q;
for(int i=0;i<q;i++){
int x;cin>>x;
int id=lower_bound(sum.begin(),sum.end(),x)-sum.begin();
cout<<v[id]<<"\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... | ||||
