Submission #674201

#	Time	Username	Problem	Language	Result	Execution time	Memory
674201		abysmal	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	83 ms	9940 KiB

Main

#include<iostream>
#include<stdio.h>
#include<stdint.h>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>

using namespace std;

const int64_t INF = (int64_t) 1e18 + 777;
const int64_t mINF = (int64_t) 1e15;
const int64_t MOD = 1e9 + 7;
const int nbit = 11;
const int ndig = 10;
const int nchar = 26;
const int p1 = 31;
const int p2 = 53;
const int D = 4;
int dr[D] = {0, 1, 0, -1};
int dc[D] = {1, 0, -1, 0};
// 0 right // 1 down // 2 left // 3 up

bool mod_cmp(int a, int b)
{
    return a > b;
}

struct Solution
{
    Solution() {}

    void solve()
    {
        int n;
        cin >> n;

        vector<int> a(n);
        vector<int64_t> c(n, 1);

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

            while(a[i] % 2 == 0)
            {
                a[i] /= 2;

                c[i] = min(c[i] * 2, mINF);
            }
        }

        vector<int64_t> prefix(n, 0);
        for(int i = 0; i < n; i++)
        {
            if(i != 0) prefix[i] = prefix[i - 1];
            prefix[i] = min(prefix[i] + c[i], mINF);
        }

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

            int l = 0;
            int r = n - 1;
            int id = -1;

            while(l <= r)
            {
                int mid = l + (r - l) / 2;

                if(prefix[mid] >= x)
                {
                    id = mid;
                    r = mid - 1;
                }
                else l = mid + 1;
            }

            if(id == -1) cout << id << "\n";
            else cout << a[id] << "\n";
        }
    }

    int modsub(int t1, int t2)
    {
        int res = t1 - t2;
        if(res < 0) res += MOD;

        return res;
    }

    int modadd(int t1, int t2)
    {
        int res = t1 + t2;
        if(res >= MOD) res -= MOD;

        return res;
    }

    int modmul(int t1, int t2)
    {
        int64_t res = 1LL * t1 * t2;
        return (res % MOD);
    }

    bool BIT(int& mask, int& j)
    {
        return (mask & MASK(j));
    }

    int MASK(int j)
    {
        return (1 << j);
    }
};

void __startup()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
}

int main()
{
    __startup();
    int t = 1;
//    cin >> t;

    for(int i = 1; i <= t; i++)
    {
        Solution().solve();
    }

    return 0;
}

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