Submission #1235368

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235368		hamanp87	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	46 ms	6980 KiB

Main

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

//#pragma GCC optimize("03,unroll-loops")
//#pragma GCC target("avx2")
//#pragma GCC target("sse4")

#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
//#define randi uniform_int_distribution<long long>
#define damoon(v) v.resize(unique(all(v))-v.begin())
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//randi dist(0,10000000000000000);

typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
typedef pair<int,bool> pib;
typedef pair<long long,bool> plb;
typedef pair<int,pii> pip;
typedef pair<pii,int> ppi;
typedef vector<int> veci;
typedef vector<long long> vecl;
typedef vector<bool> vecb;
typedef vector<pii> vecp;
typedef set<int> seti;
typedef set<long long> setl;
typedef set<pii> setp;
typedef map<int,int> mapii;
typedef map<long long,long long> mapll;
typedef map<int,bool> mapib;
typedef map<long long,bool> maplb;

const int inf=1e9,mod=1e9+7,neginf=-1e9;
const double PI=acos(-1);

void solve()
{
    int n;
    cin>>n;
    vecl b(n),p(n),ps(n);
    for(int i=0;i<n;i++)
    {
        ll a;
        cin>>a;
        ll cnt=0,pow=1;
        while((a&1)==0)
        {
            a>>=1;
            pow<<=1;
        }
        b[i]=a;
        p[i]=pow;
        ps[i]=p[i]+(i?ps[i-1]:0);
    }

    int q;
    cin>>q;
    while(q--)
    {
        ll x;
        cin>>x;
        int ind=int(lower_bound(all(ps),x)-ps.begin());

        cout<<b[ind]<<"\n";
    }
}

int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);

    //ifstream fin("in.txt");
    //ofstream fout("out.txt");

    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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