제출 #1301700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1301700		sigmaligma	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	184 ms	5316 KiB

Main

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

#define fastio                   \
    ios::sync_with_stdio(false); \
    cin.tie(nullptr);
#define s(x) x.size()
#define sort(x) sort(x.begin(), x.end())
#define rsort(x) sort(x.rbegin(), x.rend())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define INFL 1e18
#define rep(a, b) for (int a = 0; a < b; a++)

using ll = long long;
using pii = pair<int, int>;
pii how_much(int k)
{
    int s = 0;
    while (k % 2 == 0)
    {
        s++;
        k /= 2;
    }
    return {k, s};
}
void solve()
{
    int n;
    cin >> n;
    vector<int> v(n);
    vector<ll> ciag(n);
    vector<int> ciag2(n);
    ll s = 0;
    for (int i = 0; i < n; ++i)
    {
        cin >> v[i];
        pii a = how_much(v[i]);
        ciag[i] = s;
        s += (1 << a.second);
        
        ciag2[i] = a.first;
        // cout << a.first << ' ' << a.second << endl;
    }
    ll q, k;
    cin >> q;
    // for (int i = 0; i < n; i++)
    // {
    //     cout << ciag[i] << ' ';
    // }
    // cout << endl;
    for (int i = 0; i < q; i++)
    {
        cin >> k;
        auto it = lower_bound(all(ciag), k);
        it--;

        cout << ciag2[it - ciag.begin()] << endl;
    }
}

int main()
{
    fastio;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

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