제출 #681439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681439		coding_snorlax	Intercastellar (JOI22_ho_t1)	C++14	25 / 100	367 ms	5796 KiB

Main

#include<bits/stdc++.h>
using namespace std;
int T,Count;
vector<long long int> place;
vector<long long int> prefix;

int main(){
    cin>>T;
    for(int i=1;i<=T;i++){
        long long int tmp;
        cin>>tmp;
        Count = 1;
        while(!(tmp%2)){
           tmp/=2;
           Count*=2;
        }
        place.push_back(tmp);
        if(prefix.empty()) prefix.push_back(Count);
        else prefix.push_back(prefix.back()+Count);
    }
    int Q;
    cin>>Q;
    int Find;
    for(int i=1;i<=Q;i++){
        cin>>Find;
        int place_answer = lower_bound(prefix.begin(),prefix.end(),Find)-prefix.begin();
        cout<<place[place_answer]<<"\n";

    }
}

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