Submission #283228

#TimeUsernameProblemLanguageResultExecution timeMemory
283228Atill83Brunhilda’s Birthday (BOI13_brunhilda)C++14
49.21 / 100
995 ms40568 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]; 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 i = 1; i < p[m - 1]; i++){ ans[i] = 1; } for(int i = p[m - 1]; i <= 1e7; i++){ //int mnI = -1; for(int j = m - 1; j >= max(m - 10, 0LL); j--){ if(i % p[j] == 0) continue; if(ans[i - i % p[j]] + 1 < ans[i]){ ans[i] = ans[i - i % p[j]] + 1; //mnI = j; } } //cout<<ans[i]<<" "<<mnI<<endl; } for(int i = 0; i < q; i++){ int n; cin>>n; if(ans[n] > 1e7){ 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...