제출 #1128109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128109		Elwino008	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	111 ms	9204 KiB

Main

//#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define pb push_back
#define F first
#define S second
#define ll long long
#define int ll
#define pii pair<int, int>
#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define M_PI 3.14159265358979323846
#define all(v) v.begin(), v.end()
#define pss pair<string, string>
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define imp cout<<-1<<endl;
#define was cout<<ans<<endl;
#define flu cout.flush();
#define Endl endl

const int N = 200009;
const int mod = 1e9+7;

void solve(){
    int n;
    cin>>n;
    vector<int>a;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        a.pb(x);
    }
    vector<int>quv;
    int q=1;
    for(int i=0; i<35; i++){
        q=1;
        for(int j=0; j<i; j++){
            q=q*2;
        }
        if(q>INT_MAX){
            break;
        }
        quv.pb(q);
    }
    sort(all(quv));
    reverse(all(quv));
    vector<int>e, s;
    for(int i=0; i<n; i++){
        for(int k : quv){
            if(a[i]%k==0){
                e.pb(a[i]/k);
                s.pb(k);
                break;
            }
        }
    }
    vector<int>cems;
    int sum=0;
    for(int i=0; i<n; i++){
        sum+=s[i];
        cems.pb(sum);
    }
    int querry;
    cin>>querry;
    while(querry--){
        cin>>q;
        int ind=lower_bound(all(cems), q)-cems.begin();
        cout<<e[ind]<<endl;
    }
}

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

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