Submission #243439

#	Time	Username	Problem	Language	Result	Execution time	Memory
243439		anubhavdhar	Brunhilda’s Birthday (BOI13_brunhilda)	C++14	20 / 100	506 ms	1152 KiB

brunhilda

#include<bits/stdc++.h>

#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define F0R(i,n) for(int i=0;i<(n);++i)
#define F0Re(i,n) for(int i=1;i<=(n);++i)
#define F0Rr(i,a,b) for(ll i=(a);i<(b);++i)
#define F0Rrev(i,n) for(int i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first 
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cout<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()

using namespace std;

const short int __PRECISION = 10;

const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 1e4+5;
const ll ROOTN = 320;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

const int inf = 1e9 + 4;

int dp[MAXN], m, Q, p[MAXN];

inline void init()
{
	cin>>m>>Q;
	F0R(i, m)
		cin>>p[i];
	sort(p, p + m);
	dp[0] = inf;
	dp[1] = 1;
	F0Rr(i, 2, MAXN)
	{
		dp[i] = inf;
		F0R(j, m)
			if(i%p[j] != 0)
				dp[i] = min(dp[i], ((p[j] > i) ? 1 : (1 + dp[i - i%p[j]])));
	}
	// dbgLine;
}

int main()
{
	/*
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	*/
	int n;
	init();
	F0R(i, Q)
	{
		cin>>n;
		if(dp[n] < inf)
			cout<<dp[n]<<'\n';
		else
			cout<<"oo\n";
	}
	return 0;
}

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