# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155751 | souhhcong | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 483 ms | 87132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <string.h>
using namespace std;
const int N = 1e5+5, MAXN = 1e7+1e6, INF = 1e9+9;
int n, q, x, p[N], dp[MAXN], mx[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for (int i = 0; i < n; i++)
{
cin >> p[i];
for (int j = p[i]-1; j < MAXN; j += p[i])
{
mx[j] = max(mx[j], p[i]-1);
}
}
for (int i = MAXN - 2; i >= 0; i--)
mx[i] = max(mx[i], mx[i+1]-1);
for (int i = 1; i < MAXN; i++)
{
if (mx[i] > 0)
dp[i] = 1 + dp[i-mx[i]];
else
dp[i] = INF;
}
while(q--)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |