제출 #1307587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1307587		samarthkulkarni	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	53 ms	6892 KiB

Main

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define vi vector<long long>
#define all(x) x.begin(), x.end()
#define endl "\n"

void solution();
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solution();
    return 0;
}



void solution() {
	int n; cin >> n;

	vi a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		ll x = a[i];

		int z = 1;
		while (x&1^1) {z += z; x /= 2;}
		b[i] = z;
		if (i > 0)
			b[i] += b[i-1];
	}

	vi temp(n);

	for (int i = 0; i < n; i++) {
		while (a[i]&1^1) a[i]/=2;
		temp[i] = a[i];
	}





	ll q; cin >> q;
	ll j = 0;
	while (q--) {
		ll x; cin >> x;
		while (j < n && b[j] < x) j++;
		cout << temp[j] << endl;
	}
}

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