Submission #1170177

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170177		pinruei	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	46 ms	5444 KiB

Main

#pragma region //           https://oj.uz/problem/view/IOI08_printer
#include<bits/stdc++.h>
#define int long long
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
#define f2(i, m) for(int i=0; i<m; i++)
#define f21(i, m) for(int i=1; i<m; i++)
#define f3(i, n, m) for(int i=n; i<m; i++)
#define f2_(i, m) for(int i=m; i>-1; i--)
#define f21_(i, m) for(int i=m; i>0; i--)
#define f3_(i, n, m) for(int i=n; i>=m; i--)
#define travG(idx) for(int i : g[idx])
#define travG_(i, idx) for(int i : g[idx])
#define trav(loop) for(int i : loop)
#define trav_(i, loop) for(int i : loop)
#define trav2(loop, idx) for(int i : loop[idx])
#define trav2_(i, loop, idx) for(int i : loop[idx])
#define ll long long
#define bs bitset
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ve vector<element>
#define ve_ vector<element_>
#define vpii vector<pair<int, int>>
#define dqi deque<int>
#define dqpii deque<pii>
#define qi queue<int>
#define qe queue<element>
#define qpii queue<pair<int, int>>
#define si stack<int>
#define se stack<element>
#define spii stack<pair<int, int>>
#define vb vector<bool>
#define pqi priority_queue<int>
#define pqi_ priority_queue<int, vi, greater<int>>
#define pqpii priority_queue<pair<int, int>>
#define pqpii_ priority_queue<pair<int, int>, vpii, greater<pii>>
#define pb push_back
#define pf push_front
#define pob pop_back()
#define pof pop_front()
#define len length()
#define elif else if
#define mod 1000000007
#pragma endregion

#define debug
/*
#ifdef debug
#endif
#ifndef debug
#endif
*/
using namespace std;

signed main()//         https://oj.uz/problem/view/APIO16_boat
{   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, q; cin>>n;
    int pre[n], ans[n];
    
    f2(i, n)
    {
        int a;
        cin>>a;

        int t = 1;
        while((a&1)^1)
        {
            a >>= 1;
            t <<= 1;
        }
        ans[i] = a;
        pre[i] = (i?pre[i-1]:0) + t;
    }

    cin>>q;
    while(q--)
    {
        int x; cin>>x;

        cout << ans[lower_bound(pre, pre+n, x)-pre] << '\n';
    }
    return 0;
}

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