# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
816284 | QwertyPi | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 1029 ms | 114836 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;
const int MAXN = 1e7 + 11;
const int MAXM = 1e5 + 11;
int p[MAXM];
int lp[MAXN], dp[MAXN], c[MAXN], c2[MAXN], cm = 0;
void del(int p){
c2[c[p]]--;
while(cm < MAXN - 1 && c2[cm] == 0) cm++;
}
int32_t main(){
cin.tie(0); cout.tie(0)->sync_with_stdio(false);
int n, Q; cin >> n >> Q;
for(int i = 0; i < n; i++) cin >> p[i]; sort(p, p + n);
for(int i = 0; i < n; i++){
for(int j = p[i]; j < MAXN; j += p[i]){
if(!lp[j]) lp[j] = p[i];
}
}
dp[1] = 0; c2[0] = n; cm = 0;
for(int i = 2; i < MAXN; i++){
int x = i;
while(lp[x] != 0){
if(lp[x] != lp[x / lp[x]]){
del(lp[x]);
}
x /= lp[x];
}
int cur = cm;
x = i;
while(lp[x] != 0){
if(lp[x] != lp[x / lp[x]]){
c[lp[x]] = cur + 1; c2[cur + 1]++;
}
x /= lp[x];
}
dp[i] = cur + 1;
}
for(int i = 0; i < Q; i++){
int k; cin >> k; cout << (dp[k] != MAXN ? to_string(dp[k]) : "oo") << '\n';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |