# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674550 | guagua0407 | Intercastellar (JOI22_ho_t1) | C++17 | 78 ms | 8364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
希望全國賽不要墊底
全國賽策略:
0:00-0:15:讀題
0:15-3:00:寫掉有把握的
3:00-5:00:撈分+寫掉快好的
記得上廁所
記得吃東西
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {_
//setIO("wayne");
int n;
cin>>n;
int num[n+1];
for(int i=1;i<=n;i++){
cin>>num[i];
}
vector<ll> pre(n+1,0);
for(int i=1;i<=n;i++){
ll tmp=1;
while(num[i]%2==0){
tmp*=2;
num[i]/=2;
}
pre[i]=tmp+pre[i-1];
}
int q;
cin>>q;
for(int i=0;i<q;i++){
ll x;
cin>>x;
cout<<num[lower_bound(all(pre),x)-pre.begin()]<<'\n';
}
return 0;
}
//maybe its multiset not set
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |