제출 #863810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863810		phoenix0423	Intercastellar (JOI22_ho_t1)	C++17	25 / 100	39 ms	3656 KiB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 2e5 + 5;
const int INF = 1e9;

int main(void){
	fastio;
	int n;
	cin>>n;
	vector<int> a(n), cnt(n);
	for(int i = 0; i < n; i++){
		cin>>a[i];
		cnt[i] = 1;
		while(a[i] % 2 == 0) a[i] /= 2, cnt[i] *= 2;
	}
	for(int i = 1; i < n; i++) cnt[i] += cnt[i - 1];
	int q;
	cin>>q;
	int cur = 0;
	for(int i = 0; i < q; i++){
		ll x;
		cin>>x;
		while(cnt[cur] < x) cur++;
		cout<<a[cur]<<"\n";
	}

}

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