#354704 (C++14) No.843 Triple Primes

提出ソース

結果

問題	No.843 Triple Primes
ユーザー	hitonanode
提出日時	2019-06-28 21:27:30
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	26 ms / 2,000 ms
コード長	4,129 bytes
コンパイル時間	1,689 ms
コンパイル使用メモリ	175,584 KB
実行使用メモリ	5,504 KB
最終ジャッジ日時	2024-09-19 13:46:47
合計ジャッジ時間	3,366 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	25 ms 5,504 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	20 ms 5,376 KB
testcase_08	AC	21 ms 5,376 KB
testcase_09	AC	24 ms 5,488 KB
testcase_10	AC	20 ms 5,376 KB
testcase_11	AC	23 ms 5,376 KB
testcase_12	AC	25 ms 5,504 KB
testcase_13	AC	23 ms 5,496 KB
testcase_14	AC	23 ms 5,376 KB
testcase_15	AC	21 ms 5,376 KB
testcase_16	AC	20 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	1 ms 5,376 KB
testcase_20	AC	7 ms 5,376 KB
testcase_21	AC	4 ms 5,376 KB
testcase_22	AC	12 ms 5,376 KB
testcase_23	AC	14 ms 5,376 KB
testcase_24	AC	7 ms 5,376 KB
testcase_25	AC	5 ms 5,376 KB
testcase_26	AC	25 ms 5,376 KB
testcase_27	AC	3 ms 5,376 KB
testcase_28	AC	24 ms 5,504 KB
testcase_29	AC	7 ms 5,376 KB
testcase_30	AC	25 ms 5,504 KB
testcase_31	AC	3 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	8 ms 5,376 KB
testcase_34	AC	12 ms 5,376 KB
testcase_35	AC	26 ms 5,504 KB
testcase_36	AC	5 ms 5,376 KB
testcase_37	AC	19 ms 5,376 KB
testcase_38	AC	15 ms 5,376 KB
testcase_39	AC	24 ms 5,376 KB
testcase_40	AC	2 ms 5,376 KB
testcase_41	AC	2 ms 5,376 KB
testcase_42	AC	20 ms 5,376 KB
testcase_43	AC	23 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_by_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

vector<int> makePrimeLst(int N)
{
    vector<int> ans;
    vector<int> alive(N+1, 1);
    lint now = 2;
    for (; now * now <= N; now++)
    {
        if (alive[now]) ans.push_back(now);
        for (int t = now; t <= N; t += now) alive[t] = 0;
    }
    for (; now <= N; now++) if (alive[now]) ans.push_back(now);
    return ans;
}

int main()
{
    int N;
    cin >> N;
    int ret = 0;
    if (N > 1) ret--;
    vector<int> primes = makePrimeLst(N);
    set<lint> sp;
    for (auto v : primes) sp.insert(v);
    
    for (auto v : primes)
    {
        if (sp.count((lint)v * v - 2)) ret += 2;
    }
    cout << ret << endl;
}

yukicoder

結果

テストケース

ソースコード