제출 #594882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594882		PoPularPlusPlus	Intercastellar (JOI22_ho_t1)	C++17	25 / 100	43 ms	4004 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

void solve(){
	int n;
	cin >> n;
	int arr[n];
	int siz[n];
	for(int i = 0; i < n; i++){
		cin >> arr[i];
		siz[i] = 1;
		while(arr[i] % 2 == 0){
			arr[i] /= 2;
			siz[i] *= 2;
		}
	}
	int q;
	cin >> q;
	int j = 0 , sum = 0;
	for(int i = 0; i < q; i++){
		int x;
		cin >> x;
		while(sum < x){
			sum += siz[j];
			j++;
		}
		cout << arr[j-1] << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

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