Submission #1170917

#TimeUsernameProblemLanguageResultExecution timeMemory
1170917AlgorithmWarriorIntercastellar (JOI22_ho_t1)C++20
100 / 100
268 ms4472 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){
        long long pos;
        cin>>pos;
        while(frecv[id]<pos)
            ++id;
        cout<<numar[id]<<'\n';
    }
}

int main()
{
    read();
    process_queries();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...