제출 #522429

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
5224292022-02-05 02:33:37Hamed5001Brunhilda’s Birthday (BOI13_brunhilda)C++14
77.46 / 100
277 ms79180 KiB
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e7+1;
int dp[mxN], dp2[mxN];
void solve() {
int M, Q;
cin >> M >> Q;
vector<int> primes(M);
for (auto &a : primes) cin >> a;
for (auto p : primes) {
for (int i = p; i <= mxN; i += p) {
dp2[i - 1] = max(dp2[i - 1], p - 1);
}
}
for (int i = mxN - 2; i >= 0; --i) {
dp2[i] = max(dp2[i], dp2[i + 1] - 1);
}
dp[0] = 0;
for (int i = 1; i < mxN; ++i) {
dp[i] = 1e9;
dp[i] = dp[i - dp2[i]] + 1;
}
while(Q--) {
int n;
cin >> n;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...