제출 #780645

#제출 시각아이디문제언어결과실행 시간메모리
780645raphaelpIntercastellar (JOI22_ho_t1)C++14
0 / 100
2064 ms3632 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    vector<long long> value(N);
    vector<long long> len(N, 1);
    for (int i = 0; i < N; i++)
    {
        cin >> value[i];
        while (value[i] % 2 == 0)
        {
            value[i] /= 2;
            len[i] *= 2;
        }
    }
    for (int i = 1; i < N; i++)
    {
        len[i] += len[i - 1];
    }
    int Q;
    cin >> Q;
    for (int i = 0; i < Q; i++)
    {
        int x;
        cin >> x;
        int j = 0;
        while (x > len[j])
        {
            j++;
        }
        cout << value[j] << endl;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...