| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 681440 | coding_snorlax | Intercastellar (JOI22_ho_t1) | C++14 | 490 ms | 9448 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.
#include<bits/stdc++.h>
using namespace std;
long long int T,Count;
vector<long long int> place;
vector<long long int> prefix;
int main(){
cin>>T;
for(int i=1;i<=T;i++){
long long int tmp;
cin>>tmp;
Count = 1;
while(!(tmp%2)){
tmp/=2;
Count*=2;
}
place.push_back(tmp);
if(prefix.empty()) prefix.push_back(Count);
else prefix.push_back(prefix.back()+Count);
}
int Q;
cin>>Q;
long long int Find;
for(int i=1;i<=Q;i++){
cin>>Find;
int place_answer = lower_bound(prefix.begin(),prefix.end(),Find)-prefix.begin();
cout<<place[place_answer]<<"\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... | ||||
