제출 #1005711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1005711		VMaksimoski008	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	130 ms	10568 KiB

Main

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

signed main() {
    int n;
    cin >> n;

    vector<int> v(n);
    for(int &x : v) cin >> x;

    int q;
    cin >> q;

    vector<pii> qus(q);
    for(int i=0; i<q; i++) {
        cin >> qus[i].first;
        qus[i].second = i;
    }

    sort(qus.begin(), qus.end());
    ll total = 0;
    int j = 0;

    vector<ll> ans(q);
    for(int i=0; i<n; i++) {
        int cnt = 0;
        ll x = v[i];
        while(x % 2 == 0) cnt++, x /= 2;
        
        total += (1ll << cnt);
        for(; j<q; j++) {
            if(qus[j].first > total) break;
            ans[qus[j].second] = x;
        }
    }
    
    for(ll &x : ans) cout << x << '\n';
    return 0;
}

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