# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
27005 | noobprogrammer | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
int n , m , pr[100010] ;// mx[10000010] , cnt[10000010] , ptr , dp[10000010] ;
vector<int> srt[10000010] ;
const int N = 1e6 ;
int main(){
// freopen("in.txt" , "r" , stdin) ;
// freopen("out.txt" , "w" , stdout) ;
return 0 ;
scanf("%d%d" , &n,&m ) ;
for(int i=0;i<n;i++) {
scanf("%d" , pr+i) ;
for(int j=0 ; j <= (int)1e7 ; j+=pr[i]) mx[j] = max(mx[j] , pr[i]) ;
}
srt[mx[0] - 1].push_back(1) ; cnt[1]++ ;
int val = 1 ;
for(int i=1;i<=N;i++){
while(!cnt[val] && val <= 1e7 ) val++ ;
dp[i] = val ;
for(int v : srt[i]) cnt[v]-- ;
srt[i].erase(srt[i].begin() , srt[i].end() ) ;
if(dp[i] == 1e7+1) continue ;
if(!mx[i]) continue ;
srt[i+mx[i]-1].push_back(dp[i]+1) ; cnt[dp[i]+1]++ ;
}
for(int i=0;i<m;i++){
scanf("%d" , &val) ;
if(dp[val] == 1e7+1) printf("oo\n") ;
else printf("%d\n" , dp[val] ) ;
}
}