Submission #1111134

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111134		Luvidi	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	57 ms	9288 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n;
    cin>>n;
    pll a[n];
    ll p=0;
    for(int i=0;i<n;i++){
        cin>>a[i].sc;
        a[i].fs=1;
        while((a[i].sc)%2==0){
            a[i].sc>>=1;
            a[i].fs<<=1;
        }
        a[i].fs+=p;
        p=a[i].fs;
    }
    int q;
    cin>>q;
    while(q--){
        ll x;
        cin>>x;
        pll p={x,0};
        cout<<(*lower_bound(a,a+n,p)).sc<<'\n';
    }
}

int main() {
    #ifdef FPO
        freopen("in","r",stdin);
        freopen("out","w",stdout);
    #endif
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

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