結果
問題 | No.12 限定された素数 |
ユーザー | komori3 |
提出日時 | 2018-03-08 13:10:06 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 46 ms / 5,000 ms |
コード長 | 4,849 bytes |
コンパイル時間 | 1,275 ms |
コンパイル使用メモリ | 168,000 KB |
実行使用メモリ | 6,760 KB |
最終ジャッジ日時 | 2024-05-03 10:49:18 |
合計ジャッジ時間 | 3,074 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
6,592 KB |
testcase_01 | AC | 42 ms
6,600 KB |
testcase_02 | AC | 41 ms
6,596 KB |
testcase_03 | AC | 17 ms
5,376 KB |
testcase_04 | AC | 41 ms
6,600 KB |
testcase_05 | AC | 42 ms
6,596 KB |
testcase_06 | AC | 42 ms
6,592 KB |
testcase_07 | AC | 42 ms
6,724 KB |
testcase_08 | AC | 42 ms
6,724 KB |
testcase_09 | AC | 41 ms
6,600 KB |
testcase_10 | AC | 42 ms
6,556 KB |
testcase_11 | AC | 46 ms
6,724 KB |
testcase_12 | AC | 43 ms
6,596 KB |
testcase_13 | AC | 41 ms
6,724 KB |
testcase_14 | AC | 40 ms
6,596 KB |
testcase_15 | AC | 41 ms
6,596 KB |
testcase_16 | AC | 41 ms
6,728 KB |
testcase_17 | AC | 40 ms
6,728 KB |
testcase_18 | AC | 41 ms
6,724 KB |
testcase_19 | AC | 41 ms
6,596 KB |
testcase_20 | AC | 41 ms
6,760 KB |
testcase_21 | AC | 41 ms
6,596 KB |
testcase_22 | AC | 42 ms
6,596 KB |
testcase_23 | AC | 45 ms
6,600 KB |
testcase_24 | AC | 43 ms
6,720 KB |
testcase_25 | AC | 43 ms
6,600 KB |
ソースコード
#define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #include <random> using namespace std; //呪文 #define DUMPOUT cerr #define dump(...) DUMPOUT<<" ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<" ";dump_func(__VA_ARGS__) typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss; template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; } template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; } template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; } template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; } namespace aux { // print tuple template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } }; template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } }; } template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; } template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); } void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); } #define PI 3.14159265358979323846 #define EPS 1e-11 #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define all(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define fake false const int MAX = 5000000; vector<bool> p; int main() { //clock_t start, end; //start = clock(); cin.tie(0); ios::sync_with_stdio(false); p.resize(MAX + 1, true); p[0] = p[1] = false; for (int i = 2; i * i <= MAX; i++) { if (p[i]) for (int j = i * i; j <= MAX; j += i) { p[j] = false; } } int N; cin >> N; int X = 0; for (int i = 0; i < N; i++) { int b; cin >> b; X |= (1 << b); } if (X == (1 << 10) - 1) { cout << 4999999 << endl; return 0; } vector<int> primes; for (int i = 0; i <= MAX; i++) if (p[i]) primes.push_back(i); vector<int> bits(primes.size(), 0); for (int i = 0; i < bits.size(); i++) { int Y = 0; int n = primes[i]; while (n) { Y |= (1 << (n % 10)); n /= 10; } bits[i] = Y; } int ans = -1; int hoge, fuga, aaa, bbb; int M = primes.size(); for (int left = 0; left < M; left++) { int Y = 0; bool flag = false; for (int right = left; right < M; right++) { Y |= bits[right]; if (!flag && Y == X) flag = true; if ((Y | X) != X) { if (flag) { int pl = (left == 0 ? 1 : primes[left - 1] + 1); int pr = (right == M - 1 ? primes[right] : primes[right] - 1); if (ans < pr - pl) { hoge = pl; fuga = pr; aaa = primes[left]; bbb = primes[right]; } ans = max(ans, pr - pl); } break; } } } //dump(hoge, fuga, aaa, bbb); cout << (ans == -1 ? -1 : ans) << endl; //end = clock(); //printf("%d msec.\n", end - start); return 0; }