結果
問題 | No.12 限定された素数 |
ユーザー | Konton7 |
提出日時 | 2020-06-17 12:57:19 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 3,485 ms / 5,000 ms |
コード長 | 6,037 bytes |
コンパイル時間 | 2,297 ms |
コンパイル使用メモリ | 213,156 KB |
実行使用メモリ | 29,840 KB |
最終ジャッジ日時 | 2024-07-03 12:15:01 |
合計ジャッジ時間 | 96,641 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3,419 ms
29,576 KB |
testcase_01 | AC | 3,419 ms
28,908 KB |
testcase_02 | AC | 3,449 ms
29,588 KB |
testcase_03 | AC | 3,458 ms
28,880 KB |
testcase_04 | AC | 3,485 ms
29,348 KB |
testcase_05 | AC | 3,431 ms
29,440 KB |
testcase_06 | AC | 3,475 ms
27,932 KB |
testcase_07 | AC | 3,437 ms
28,816 KB |
testcase_08 | AC | 3,472 ms
27,940 KB |
testcase_09 | AC | 3,453 ms
29,416 KB |
testcase_10 | AC | 3,427 ms
28,200 KB |
testcase_11 | AC | 3,475 ms
29,184 KB |
testcase_12 | AC | 3,453 ms
29,576 KB |
testcase_13 | AC | 3,438 ms
29,496 KB |
testcase_14 | AC | 3,466 ms
28,760 KB |
testcase_15 | AC | 3,468 ms
28,836 KB |
testcase_16 | AC | 3,444 ms
28,684 KB |
testcase_17 | AC | 3,461 ms
27,616 KB |
testcase_18 | AC | 3,469 ms
28,908 KB |
testcase_19 | AC | 3,458 ms
29,480 KB |
testcase_20 | AC | 3,437 ms
29,280 KB |
testcase_21 | AC | 3,458 ms
28,164 KB |
testcase_22 | AC | 3,411 ms
29,840 KB |
testcase_23 | AC | 3,440 ms
27,892 KB |
testcase_24 | AC | 3,441 ms
28,880 KB |
testcase_25 | AC | 3,447 ms
28,264 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<int>; using VL = vector<ll>; using VS = vector<string>; using VB = vector<bool>; using VVI = vector<VI>; using VVL = vector<VL>; using PII = std::pair<int, int>; using PLL = std::pair<ll, ll>; using TI3 = std::tuple<int, int, int>; using TI4 = std::tuple<int, int, int, int>; using TL3 = std::tuple<ll, ll, ll>; using TL4 = std::tuple<ll, ll, ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const int mod = mod1; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template <typename T> void show1dvec(const vector<T> &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template <typename T> void show2dvec(const vector<vector<T>> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template <typename T, typename S> void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template <typename T> void maxvec(vector<T> &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template <typename T, typename S> bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } template <typename T> vector<T> cumsum(const vector<T> &v) { T s = 0; vector<T> ret; rep(i, v.size()) { s += v[i]; s %= mod; ret.emplace_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } string removezero(string &s) { string ret; for (auto z : s) if (z != '0') ret += z; return ret; } ll sumdigit(ll x) { ll ans{0}; while (x > 0) { ans += x % 10; x /= 10; } return ans; } template <typename T, typename S, typename R> ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } template <typename T, typename S> ll pow_no_mod(T p, S q) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r; r = (r * r), q /= 2; } return ret; } void make_frac_tables(VL &frac_list, VL &frac_inv_list) { rep(i, frac_list.size() - 1) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } } ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) { if (a < b) return 0; if (b < 0) return 0; ll ret = frac_list[a]; ret *= frac_inv_list[b]; ret %= mod; ret *= frac_inv_list[a - b]; ret %= mod; return ret; } void shave(vector<int> &v, int n) { vector<int> x, y; int n_sq = sqrt(n) + 1; for (int i = 3; i < n + 1; i += 2) { x.emplace_back(i); } for (int i = 3; i < n_sq; i += 2) { for (auto itr = x.begin(); itr != x.end(); itr++) { if (*itr == i || *itr % i != 0) y.emplace_back(*itr); } x.clear(); x = y; y.clear(); } if (n >= 2) v.emplace_back(2); for (auto itr = x.begin(); itr != x.end(); itr++) { v.emplace_back(*itr); } } int main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif int n, m, x, y, z, w, l, r, ans{-1}; constexpr int range = 5000000; VI primes, primes_ok; shave(primes, range); VI digits(10); cin >> n; VI use_digit(10, 0); rep(i, n) { cin >> x; use_digit[x]++; } primes.insert(primes.begin(), 0); primes.emplace_back(range + 1); m = primes.size(); primes_ok.resize(m); fill(allpt(primes_ok), 0); fill(allpt(digits), 0); l = 1; rep2(i, 1, m - 1) { x = primes[i]; y = z = w = 0; while (x > 0) { digits[x % 10] = 1; x /= 10; y++; } // show1dvec(use_digit); // show1dvec(digits); // cout << rt; rep(i, 10) { z += (use_digit[i] == digits[i]); w += (use_digit[i] == 0 && digits[i] == 1); } r = primes[i + 1] - 1; if (z == 10) { primes_ok[i] = 1; ans = max(ans, r - l); // cout << primes[i] << rt; } else if (w) { fill(allpt(digits), 0); l = primes[i] + 1; } } cout << ans << rt; return 0; }