Submission #538646

#	Time	Username	Problem	Language	Result	Execution time	Memory
538646		Harry464	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	523 ms	5376 KiB

Main

#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

int main(){

    ll n;
    cin >> n;

    vector <ll> a(n);

    for (int i = 0; i < n; i++)
        cin >> a[i];

    vector <ll> prefsum(1,0);
    for (int i = 0; i < n; i++){

        ll stependv = 1;
        while (a[i]%(stependv*2) == 0)
         stependv *= 2;
        
        a[i]/= stependv;
        prefsum.push_back(prefsum[i] + stependv);

    }

    ll q;
    cin >> q;
    for (int i = 0; i < q; i++){

        ll x;
        cin >> x;

        ll l = 1, r = n; 

        while (l < r){

            ll mid = (l+r)/2;
            if (prefsum[mid] < x)
              l = mid + 1;
            else
              r = mid;

        }

        cout << a[l-1] << endl;


    }

}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40