159272025-03-24 18:20:39algoproAz óvodai lét elviselhetetlen könnyűsége #2cpp17Wrong answer 30/1001.083s80380 KiB
// UUID: 5f5d7843-2784-4b40-9a4c-cf9059264502
// 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
1Accepted125ms78644 KiB
2Accepted280ms79412 KiB
subtask220/20
3Accepted259ms78644 KiB
4Accepted284ms78640 KiB
5Accepted321ms78644 KiB
6Accepted289ms78644 KiB
7Accepted488ms78556 KiB
8Accepted561ms78644 KiB
9Accepted774ms78500 KiB
10Accepted1.083s78644 KiB
subtask310/10
11Accepted326ms79408 KiB
12Accepted444ms79516 KiB
13Accepted358ms79488 KiB
14Accepted499ms79288 KiB
15Accepted377ms79412 KiB
16Accepted351ms79668 KiB
17Accepted264ms79924 KiB
subtask40/15
18Accepted163ms78644 KiB
19Accepted230ms78644 KiB
20Accepted194ms79156 KiB
21Accepted268ms78636 KiB
22Accepted317ms79412 KiB
23Accepted556ms78644 KiB
24Accepted579ms78644 KiB
25Accepted583ms78644 KiB
26Wrong answer418ms78636 KiB
27Accepted583ms78900 KiB
subtask50/55
28Accepted446ms80180 KiB
29Wrong answer224ms80248 KiB
30Accepted296ms79668 KiB
31Wrong answer175ms79668 KiB
32Accepted250ms79668 KiB
33Wrong answer407ms79672 KiB
34Accepted395ms79668 KiB
35Accepted393ms79664 KiB
36Accepted634ms79660 KiB
37Accepted312ms79668 KiB
38Accepted321ms80124 KiB
39Accepted238ms80380 KiB