159292025-03-24 18:20:42algoproAz óvodai lét elviselhetetlen könnyűsége #2cpp17Wrong answer 30/1001.06s79164 KiB
// UUID: 20fe2891-3fc7-4f04-b589-745d49bfb44c
// 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
1Accepted115ms78644 KiB
2Accepted351ms79156 KiB
subtask220/20
3Accepted243ms78644 KiB
4Accepted266ms78644 KiB
5Accepted241ms78640 KiB
6Accepted231ms78480 KiB
7Accepted354ms78644 KiB
8Accepted527ms78640 KiB
9Accepted1.06s78644 KiB
10Accepted1s78644 KiB
subtask310/10
11Accepted273ms78644 KiB
12Accepted370ms78644 KiB
13Accepted289ms78644 KiB
14Accepted367ms78892 KiB
15Accepted374ms78644 KiB
16Accepted418ms78644 KiB
17Accepted218ms78644 KiB
subtask40/15
18Accepted174ms78644 KiB
19Accepted245ms78644 KiB
20Accepted182ms78644 KiB
21Accepted426ms78648 KiB
22Accepted379ms78540 KiB
23Accepted507ms78644 KiB
24Accepted509ms78648 KiB
25Accepted439ms78640 KiB
26Wrong answer509ms78644 KiB
27Accepted725ms78568 KiB
subtask50/55
28Accepted435ms78644 KiB
29Wrong answer221ms78892 KiB
30Accepted347ms78900 KiB
31Wrong answer199ms79164 KiB
32Accepted379ms78900 KiB
33Wrong answer372ms78904 KiB
34Accepted458ms78900 KiB
35Accepted458ms78900 KiB
36Accepted449ms78900 KiB
37Accepted272ms78900 KiB
38Accepted266ms78900 KiB
39Accepted211ms78644 KiB