Submission #1160990

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160990		Nonoze	Brunhilda’s Birthday (BOI13_brunhilda)	C++20	2.54 / 100	1098 ms	92416 KiB

brunhilda

/*
*	Author: Nonoze
*	Created: Monday 03/03/2025
*/
#include <bits/stdc++.h>
using namespace std;

#ifndef IN_LOCAL
	#define dbg(...)
#endif

// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")

// #define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;


void solve();

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	// cin >> tt;
	while(tt--) solve();
	return 0;
}


int n, k, m, q;
vector<int> a;


void solve() {
	read(m, q);
	a.clear(), a.resize(m); read(a);
	vector<int> dp(10000001); dp[0]=0;
	set<int> points; points.insert(0);
	multiset<pair<int, int>> st; for (int i=0; i<m; i++) st.insert({0, -a[i]});
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> pq; for (int i=0; i<m; i++) pq.push({a[i], i});
	int cnt=0;
	for (int i=pq.top().fi; i<sz(dp); i=-st.begin()->se) {
		points.insert(i);
		vector<int> vec;
		while (!pq.empty() && pq.top().fi<=i) {
			vec.pb(pq.top().se);
			st.erase(st.find({pq.top().fi-a[pq.top().se], -pq.top().fi}));
			pq.pop();
		}
		if (st.empty()) dp[i]=1000000000;
		else dp[i]=min(1000000000, dp[st.begin()->fi]+1);

		for (auto x: vec) {
			int mod=i%a[x];
			st.insert({i-mod, -(i-mod+a[x])}), pq.push({i-mod+a[x], x});
			if (mod) cmin(dp[i], dp[i-mod]+1);
		}
	}
	while (q--) {
		read(n);
		auto lb=*prev(points.upper_bound(n));
		if (dp[lb]==1000000000) cout << "oo" << endl;
		else cout << dp[lb] << endl;
	}
}

• Subtask 1: 1.1111 / 20
• Subtask 2: 0 / 20
• Subtask 3: 1.4286 / 60