159302025-03-24 18:20:43algoproAz óvodai lét elviselhetetlen könnyűsége #2cpp17Wrong answer 30/1001.057s78948 KiB
// UUID: 6076174d-1d3b-4858-b3cc-5cb2376dc3fd
// Source: https://usaco.guide/general/io

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

int m, q;
const int maxn=1e7+1;
int f[maxn];
int dp[maxn];

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);

	cin>>m>>q;
    
    for (int i=0;i<m;i++){
        int a;
        cin>>a;
        for (int j=a-1;j<maxn;j+=a) f[j]=max(f[j], a-1);
    }
    for (int i=maxn-2;i>0;i--) f[i]=max(f[i], f[i+1]-1);
    
    dp[0]=0;
    int pos=maxn;
    for (int i=1;i<maxn;i++){
        if (!f[i]) pos=min(pos,i);
        dp[i]=dp[i-f[i]]+1;
    }

    for (int i=0;i<q;i++){
        int n;
        cin>>n;
        if (n>=pos) {
            cout<<"0\n";
            continue;
        }
        cout<<dp[n]<<"\n";
    }
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted114ms78644 KiB
2Accepted368ms78900 KiB
subtask220/20
3Accepted195ms78504 KiB
4Accepted273ms78644 KiB
5Accepted222ms78476 KiB
6Accepted210ms78644 KiB
7Accepted324ms78644 KiB
8Accepted467ms78644 KiB
9Accepted1.057s78644 KiB
10Accepted1.019s78644 KiB
subtask310/10
11Accepted345ms78644 KiB
12Accepted458ms78644 KiB
13Accepted319ms78832 KiB
14Accepted402ms78768 KiB
15Accepted533ms78648 KiB
16Accepted470ms78644 KiB
17Accepted224ms78644 KiB
subtask40/15
18Accepted138ms78524 KiB
19Accepted229ms78644 KiB
20Accepted143ms78644 KiB
21Accepted340ms78644 KiB
22Accepted266ms78644 KiB
23Accepted328ms78644 KiB
24Accepted335ms78644 KiB
25Accepted404ms78644 KiB
26Wrong answer490ms78480 KiB
27Accepted940ms78644 KiB
subtask50/55
28Accepted497ms78808 KiB
29Wrong answer241ms78748 KiB
30Accepted314ms78736 KiB
31Wrong answer165ms78900 KiB
32Accepted236ms78816 KiB
33Wrong answer284ms78900 KiB
34Accepted370ms78948 KiB
35Accepted421ms78784 KiB
36Accepted643ms78900 KiB
37Accepted293ms78776 KiB
38Accepted381ms78900 KiB
39Accepted319ms78900 KiB