Submission #886587

#	Time	Username	Problem	Language	Result	Execution time	Memory
886587		ono_de206	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	58 ms	16064 KiB

Main

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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523;
const long long inf = 2e18 + 10;

void go() {
	int n;
	cin >> n;
	vector<pair<int, int>> v;
	for(int i = 0; i < n; i++) {
		int x;
		cin >> x;
		int cnt = 1;
		while(!(x & 1)) {
			cnt <<= 1;
			x >>= 1;
		}
		v.eb(x, cnt);
	}
	int q;
	cin >> q;
	vector<pair<int, int>> qs;
	vector<int> ans(q);
	for(int i = 0; i < q; i++) {
		int x;
		cin >> x;
		qs.eb(x, i);
	}
	sort(all(qs));
	int cnt = 0, l = 0;
	for(int i = 0; i < n; i++) {
		cnt += v[i].ss;
		while(l < q && qs[l].ff <= cnt) {
			ans[qs[l].ss] = v[i].ff;
			l++;
		}
	}
	for(int i = 0; i < q; i++) {
		cout << ans[i] << '\n';
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

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