Submission #1239983

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239983		kamrad	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	63 ms	6316 KiB

Main

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

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

using ll  = long long;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pi3 = pair<pii, int>;

#define IOS               ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define F                 first
#define S                 second
#define sz(x)             x.size()
#define all(x)            x.begin(), x.end()
#define pb                push_back
#define cl                clear
#define minr(a, b)        a = min(a, b);
#define maxr(a, b)        a = max(a, b);
#define shit              cout << "shit\n" << flush;
#define tl                while(1&1) continue;
#define FOR(i, st, nd)    for(int i = st; i <= nd; i++)
#define rand(l, r)        uniform_int_distribution<int64_t>(l,r)(rng)
random_device device;     default_random_engine rng(device());

const int Mod    = 1e9 + 7; //998244353;
const int LG     = 64;
const int SQ     = 500;
const int Inf    = 2e9 + 10;
const int maxN   = 2e5 + 10;

int n;
int q;
int a[maxN];

vector <pll> val;

int main() {
	IOS;

	cin >> n;

	ll cur = 0;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		int cnt = 0;
		while(!(a[i]%2)) {
			a[i]/=2;
			cnt++;
		}
		val.pb({cur+1, a[i]});
		cur += (1LL<<cnt);
	}

	cin >> q;
	while(q--) {
		ll x;
		cin >> x;
		int idx = upper_bound(all(val), pll(x, Inf)) - val.begin() - 1;
		cout << val[idx].S << "\n";
	}
}

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