# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631302 | SanguineChameleon | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 128 ms | 50804 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.
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
long long rand_range(long long rmin, long long rmax) {
uniform_int_distribution<long long> rdist(rmin, rmax);
return rdist(kami_gen);
}
void file_io(string fi, string fo) {
if (fi != "" && (!kami_loc || fi == kami_fi)) {
freopen(fi.c_str(), "r", stdin);
}
if (fo != "" && (!kami_loc || fo == kami_fo)) {
freopen(fo.c_str(), "w", stdout);
}
}
void set_up() {
if (kami_loc) {
file_io(kami_fi, kami_fo);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void just_do_it();
void just_exec_it() {
if (kami_loc) {
auto pstart = chrono::steady_clock::now();
just_do_it();
auto pend = chrono::steady_clock::now();
long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
string bar(50, '=');
cout << '\n' << bar << '\n';
cout << "Time: " << ptime << " ms" << '\n';
}
else {
just_do_it();
}
}
int main() {
set_up();
just_exec_it();
return 0;
}
// END BOILERPLATE CODE
// BEGIN MAIN CODE
const int ms = 1e7 + 20;
const int inf = 1e9 + 20;
bool g[ms];
int pr[ms];
int p[ms];
int cc[ms];
int dp[ms];
int qz[ms];
int sz;
void just_do_it() {
int n, q;
cin >> n >> q;
p[1] = 1;
for (int i = 2; i < ms; i++) {
if (!p[i]) {
p[i] = i;
pr[sz++] = i;
}
for (int j = 0; j < sz; j++) {
if (i * pr[j] >= ms) {
break;
}
p[i * pr[j]] = pr[j];
if (i % pr[j] == 0) {
break;
}
}
}
for (int i = 0; i < n; i++) {
int d;
cin >> d;
g[d] = true;
}
cc[0] = n;
int lt = 0;
int rt = 0;
for (int i = 1; i < 100; i++) {
int f = -1;
int x = i;
while (x != 1) {
if (p[x] != f) {
f = p[x];
if (g[f]) {
cc[i]++;
cc[i - p[x]]--;
}
}
x /= p[x];
}
while (lt <= rt && !cc[qz[lt]]) {
lt++;
}
if (lt > rt) {
for (int j = i; j < ms; j++) {
dp[j] = inf;
}
break;
}
else {
dp[i] = dp[qz[lt]] + 1;
}
qz[++rt] = i;
}
for (int i = 0; i < q; i++) {
int d;
cin >> d;
if (dp[d] == inf) {
cout << "oo" << '\n';
}
else {
cout << dp[d] << '\n';
}
}
}
// END MAIN CODE
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... |