Submission #283181

#	Time	Username	Problem	Language	Result	Execution time	Memory
283181		theStaticMind	Brunhilda’s Birthday (BOI13_brunhilda)	C++14	0 / 100	295 ms	262148 KiB

brunhilda

#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
//#define int long long int
using namespace std;

int dp[10000001];

vector<int> f[10000001];

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int m, q;
	cin >> m >> q;

	set<ii> ptr;
	vector<int> P(m);
	for(int i = 0; i < m; i++){
		cin >> P[i];

		for(int j = P[i]; j <= 10000000; j += P[i]){
			f[j].pb(P[i]);
		}
		ptr.insert({0, P[i]});
	}



	for(int i = 1; i <= 1e7; i++) dp[i] = 1e9;
	
	for(int i = 1; i <= 1e7; i++){
		for(auto p : f[i]){
			ptr.erase({i - p, p});
			ptr.insert({i, p});
		}
		if(ptr.begin()->first != i) dp[i] = dp[ptr.begin()->first] + 1;
		else break;
	}

	while(q--){
		int n;
		cin >> n;

		if(dp[n] >= 1e9) cout << "oo\n";
		else cout << dp[n] << "\n";
	}
}

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