제출 #283258

#제출 시각아이디문제언어결과실행 시간메모리
283258Atill83Brunhilda’s Birthday (BOI13_brunhilda)C++14
100 / 100
345 ms119484 KiB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e7+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll m, q;
ll p[(int)1e5 + 5];
ll buyp[(int)1e7 + 5];
int ans[MAXN];



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>m>>q;
    memset(ans, 0x7f, sizeof(ans));
    
    for(int i = 0; i < m; i++){
        cin>>p[i];
        for(int j = 0; j <= 1e7; j += p[i]){
            buyp[j] = p[i];
        }
    }

    int last = 0;
    ans[0] = 0;
    for(int i = 1; i <= 1e7; i++){
        while(last + buyp[last] <= i && last <= i) last++;
        if(last < i) ans[i] = ans[last] + 1;
        else break;
    }



    for(int i = 0; i < q; i++){
        int n;
        cin>>n;
        if(ans[n] >= 2139062143){
            cout<<"oo"<<endl;
        }else{
            cout<<ans[n]<<endl;
        }
    }

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...