159312025-03-24 18:20:45algoproAz óvodai lét elviselhetetlen könnyűsége #2cpp17Wrong answer 30/1001.093s78904 KiB
// UUID: ce960297-0da9-4afa-ba10-4b68c2bc4cc1
// 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
1Accepted114ms78496 KiB
2Accepted456ms78900 KiB
subtask220/20
3Accepted239ms78644 KiB
4Accepted232ms78644 KiB
5Accepted232ms78644 KiB
6Accepted195ms78644 KiB
7Accepted437ms78644 KiB
8Accepted523ms78644 KiB
9Accepted1.093s78644 KiB
10Accepted1.074s78644 KiB
subtask310/10
11Accepted307ms78644 KiB
12Accepted425ms78644 KiB
13Accepted328ms78644 KiB
14Accepted479ms78900 KiB
15Accepted479ms78736 KiB
16Accepted360ms78644 KiB
17Accepted263ms78640 KiB
subtask40/15
18Accepted178ms78644 KiB
19Accepted195ms78648 KiB
20Accepted136ms78644 KiB
21Accepted296ms78644 KiB
22Accepted282ms78584 KiB
23Accepted407ms78644 KiB
24Accepted414ms78644 KiB
25Accepted527ms78644 KiB
26Wrong answer476ms78588 KiB
27Accepted828ms78480 KiB
subtask50/55
28Accepted451ms78900 KiB
29Wrong answer203ms78648 KiB
30Accepted372ms78732 KiB
31Wrong answer150ms78740 KiB
32Accepted310ms78820 KiB
33Wrong answer425ms78904 KiB
34Accepted444ms78900 KiB
35Accepted372ms78900 KiB
36Accepted499ms78900 KiB
37Accepted216ms78900 KiB
38Accepted402ms78900 KiB
39Accepted284ms78900 KiB