Submission #703345

#	Time	Username	Problem	Language	Result	Execution time	Memory
703345		Aestivate	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	124 ms	6996 KiB

Main

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

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

#define float double
#define ss(n) fixed<<setprecision(n) 
#define ll long long
#define int ll
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define rep(i,a) for(int i=1;i<=a;i++)
#define rep0(i,a) for(int i=0;i<a;i++)
#define F first
#define S second
#define uni(a) a.resize(distance(a.begin(),unique(a.begin(),a.end())));
#define unisort(a) sort(a.begin(),a.end()); uni(a);

ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}

const ld pi=3.14159265358979323846264338327950288419716939931;
const int lar=3e18;
const int mol1=1e9+7;
const int mol2=998244353;
const int MX=2e5+5;

void solve()
{
    int n;
    cin>>n;
    int a[n+1];
    rep(i,n) cin>>a[i];
    int pre[n+1]={0};
    vector<int>ans;
    rep(i,n){
        int hh=0;
        for(int j=33;j>=0;j--){
            if((a[i]%(1LL<<j))==0){
                hh=j;
                break;
            }
        }
        int bb=a[i]/(1LL<<hh);
        pre[i]=pre[i-1]+(1LL<<hh);
        ans.pb(bb);
    }
    int q;
    cin>>q;
    rep(i,q) {
        int g;
        cin>>g;
        int l=0,r=n;
        while(l<r){
            int mid=l+r>>1;
            int gg=pre[mid];
            if(g>gg) l=mid+1;
            else r=mid;
        }
        cout<<ans[l-1]<<"\n";
    }
}   

signed main()
{
    IO
    solve();
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:59:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |             int mid=l+r>>1;
      |                     ~^~

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