제출 #1320057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1320057		hyyh	Intercastellar (JOI22_ho_t1)	C++20	25 / 100	218 ms	2532 KiB

Main

#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <stdio.h>
#include <unordered_map>
#include <bitset>
#include <tuple>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define endl '\n'
#define f first
#define s second

int main(){
    int n;cin >> n;
    vector<pii> vc = {{0,0}};
    for(int i{};i < n;i++){
        int g;cin >> g;
        int j = 2;
        for(;g%j == 0;j*=2){}
        j/=2;
        vc.emplace_back(vc.back().f+j,g/j);
    }
    int m;cin >> m;
    for(int j{};j < m;j++){
        int g;cin >> g;
        cout << upper_bound(vc.begin(),vc.end(),make_pair(g,0))->s << endl;
    }
}

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