#752200 (C++17) No.732 3PrimeCounting

• 問題: No.732 3PrimeCounting
• ユーザー: recososo
• 提出日時: 2022-04-07 20:27:22
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 481 ms / 3,000 ms
• コード長: 3,193 bytes
• コンパイル時間: 1,923 ms
• コンパイル使用メモリ: 204,688 KB
• 実行使用メモリ: 8,296 KB
• 最終ジャッジ日時: 2023-08-18 18:40:26
• 合計ジャッジ時間: 9,950 ms
• ジャッジサーバーID （参考情報）: judge13 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,376 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	2 ms; 4,376 KB
testcase_03	AC	2 ms; 4,384 KB
testcase_04	AC	2 ms; 4,380 KB
testcase_05	AC	1 ms; 4,380 KB
testcase_06	AC	1 ms; 4,376 KB
testcase_07	AC	2 ms; 4,376 KB
testcase_08	AC	1 ms; 4,380 KB
testcase_09	AC	1 ms; 4,380 KB
testcase_10	AC	1 ms; 4,376 KB
testcase_11	AC	2 ms; 4,376 KB
testcase_12	AC	1 ms; 4,380 KB
testcase_13	AC	1 ms; 4,376 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	1 ms; 4,376 KB
testcase_16	AC	2 ms; 4,380 KB
testcase_17	AC	1 ms; 4,380 KB
testcase_18	AC	1 ms; 4,376 KB
testcase_19	AC	1 ms; 4,376 KB
testcase_20	AC	2 ms; 4,380 KB
testcase_21	AC	2 ms; 4,380 KB
testcase_22	AC	2 ms; 4,376 KB
testcase_23	AC	1 ms; 4,380 KB
testcase_24	AC	1 ms; 4,380 KB
testcase_25	AC	3 ms; 4,376 KB
testcase_26	AC	2 ms; 4,376 KB
testcase_27	AC	1 ms; 4,376 KB
testcase_28	AC	2 ms; 4,376 KB
testcase_29	AC	1 ms; 4,376 KB
testcase_30	AC	2 ms; 4,380 KB
testcase_31	AC	3 ms; 4,376 KB
testcase_32	AC	3 ms; 4,376 KB
testcase_33	AC	2 ms; 4,380 KB
testcase_34	AC	3 ms; 4,376 KB
testcase_35	AC	2 ms; 4,376 KB
testcase_36	AC	3 ms; 4,376 KB
testcase_37	AC	2 ms; 4,380 KB
testcase_38	AC	1 ms; 4,376 KB
testcase_39	AC	3 ms; 4,376 KB
testcase_40	AC	2 ms; 4,376 KB
testcase_41	AC	2 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	2 ms; 4,376 KB
testcase_44	AC	2 ms; 4,376 KB
testcase_45	AC	2 ms; 4,380 KB
testcase_46	AC	1 ms; 4,376 KB
testcase_47	AC	2 ms; 4,380 KB
testcase_48	AC	4 ms; 4,380 KB
testcase_49	AC	4 ms; 4,376 KB
testcase_50	AC	2 ms; 4,380 KB
testcase_51	AC	2 ms; 4,380 KB
testcase_52	AC	2 ms; 4,376 KB
testcase_53	AC	8 ms; 4,376 KB
testcase_54	AC	142 ms; 5,912 KB
testcase_55	AC	144 ms; 5,916 KB
testcase_56	AC	143 ms; 5,852 KB
testcase_57	AC	25 ms; 4,376 KB
testcase_58	AC	26 ms; 4,376 KB
testcase_59	AC	9 ms; 4,376 KB
testcase_60	AC	38 ms; 4,384 KB
testcase_61	AC	38 ms; 4,380 KB
testcase_62	AC	193 ms; 6,236 KB
testcase_63	AC	76 ms; 5,272 KB
testcase_64	AC	50 ms; 4,608 KB
testcase_65	AC	50 ms; 4,688 KB
testcase_66	AC	1 ms; 4,380 KB
testcase_67	AC	1 ms; 4,376 KB
testcase_68	AC	166 ms; 6,188 KB
testcase_69	AC	167 ms; 6,224 KB
testcase_70	AC	155 ms; 5,864 KB
testcase_71	AC	147 ms; 5,996 KB
testcase_72	AC	70 ms; 5,140 KB
testcase_73	AC	340 ms; 7,344 KB
testcase_74	AC	329 ms; 7,340 KB
testcase_75	AC	3 ms; 4,376 KB
testcase_76	AC	164 ms; 6,112 KB
testcase_77	AC	29 ms; 4,376 KB
testcase_78	AC	245 ms; 6,800 KB
testcase_79	AC	168 ms; 6,112 KB
testcase_80	AC	215 ms; 6,600 KB
testcase_81	AC	159 ms; 5,920 KB
testcase_82	AC	2 ms; 4,380 KB
testcase_83	AC	27 ms; 4,376 KB
testcase_84	AC	31 ms; 4,376 KB
testcase_85	AC	119 ms; 5,644 KB
testcase_86	AC	224 ms; 6,856 KB
testcase_87	AC	480 ms; 8,296 KB
testcase_88	AC	481 ms; 8,160 KB

ソースコード

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
#define ALLR(v) (v).rbegin(),(v).rend()
#define fi first
#define se second
#define PB push_back
#define EB emplace_back
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T>void debug(const T &v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j]<<" \n"[j==w-1];}};
template<typename T>void debug(const T &v,ll n){for(ll i=0;i<n;i++)cout<<v[i]<<" \n"[i==n-1];};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
// const int mod=1e9+7;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin >> n;
    vector<bool> p(3*n+1,true);
    p[0]=p[1]=false;
    for(int i=2;i*i<=3*n;i++){
        if(p[i]) for(int j=2;j*i<=3*n;j++) p[i*j]=false;
    }
    vector<ll> sm(3*n+1);
    vector<ll> pl;
    REP(i,n+1) if(p[i]) pl.PB(i);
    for(auto x:pl){
        for(auto y:pl) if(x<y) sm[x+y]++;
    }
    ll ans=0;
    vector<ll> pabc;
    REP(i,3*n+1) if(p[i]) pabc.PB(i);
    ll pmx=5;
    vector<ll> c(3*n+1);
    c[5]++;
    FOR(i,2,pl.size()){
        REP(j,pabc.size()){
            if(pl[i]>pabc[j]) continue;
            if(pabc[j]-pl[i]>pmx) continue;
            ans+=c[pabc[j]-pl[i]];
        }
        REP(j,i) c[pl[i]+pl[j]]++;
        chmax(pmx,pl[i]+pl[i-1]);
    }
    cout << ans << endl;
}