제출 #152504

#제출 시각아이디문제언어결과실행 시간메모리
152504dolphingarlicBrunhilda’s Birthday (BOI13_brunhilda)C++14
74.13 / 100
592 ms237652 KiB
#include <bits/stdc++.h> #pragma GCC Optimize("O3") #define FOR(i, x, y) for (int i = x; i < y; i++) #define MAXN 10000001 typedef long long ll; using namespace std; ll dp[MAXN], p[100001], max_divide[MAXN], to[MAXN]; int main() { iostream::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; FOR(i, 0, n) cin >> p[i]; FOR(i, 0, n) for (int j = p[i]; j < MAXN; j += p[i]) max_divide[j] = p[i]; ll mn = INT_MAX; for (int i = MAXN - 1; i > 0; i--) { mn = min(mn, i + 1 - max_divide[i + 1]); to[i] = mn; } FOR(i, 1, MAXN) if (to[i] == i) dp[i] = -1; else dp[i] = dp[to[i]] + 1; FOR(i, 0, q) { int x; cin >> x; if (dp[x] == -1) cout << "oo\n"; else cout << dp[x] << '\n'; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

brunhilda.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...