Submission #702630

#	Time	Username	Problem	Language	Result	Execution time	Memory
702630		Chal1shkan	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	86 ms	9148 KiB

Main

# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define deb(x) cerr << #x  << " = " << x << endl; 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = 2e5 + 25;
const ll inf = 2e9 + 0;
const ll mod = 998244353;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;

ll n, q, a[maxn];
ll pref[maxn];

void ma1n (/* SABR */)
{
	cin >> n;
	for (ll i = 1; i <= n; ++i)
	{
		cin >> a[i];
		ll c = 1;
		while (a[i] % 2 == 0)
		{
			c *= 2;
			a[i] /= 2;
		}
		pref[i] = pref[i - 1] + c;
	}
	cin >> q;
	while (q--)
	{
		ll w;
		cin >> w;
		ll l = 1, r = n, id = n;
		while (l <= r)
		{
			ll mid = (l + r) >> 1;
			if (pref[mid] < w)
			{
				l = mid + 1;
			}
			else
			{
				r = mid - 1;
				id = mid;
			}
		}
		cout << a[id] << nl;
	}
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//    freopen("angry.in", "r", stdin);
//    freopen("angry.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << ' ';
        ma1n();
    }
    return 0;
}

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