| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1170916 | AlgorithmWarrior | Intercastellar (JOI22_ho_t1) | C++20 | 181 ms | 2964 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=2e5+5;
int numar[MAX];
long long frecv[MAX];
int n,q;
void read(){
cin>>n;
int i;
for(i=1;i<=n;++i){
int nr;
cin>>nr;
int fr=1;
while(nr%2==0){
nr/=2;
fr*=2;
}
numar[i]=nr;
frecv[i]=frecv[i-1]+fr;
}
}
void process_queries(){
cin>>q;
int id=1;
int i;
for(i=1;i<=q;++i){
int pos;
cin>>pos;
while(frecv[id]<pos)
++id;
cout<<numar[id]<<'\n';
}
}
int main()
{
read();
process_queries();
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
