raw source code
/* fftライブラリをパクったのがパクリ元にバレる */
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

namespace FastFourierTransform {
        using C = complex<double>;

        void discreteFourierTransform(vector<C> &F, bool rev) {
                const int N = (int)F.size();
                const double PI = (rev ? -1 : 1) * acos(-1);
                for (int i = 0, j = 1; j + 1 < N; j++) {
                        for (int k = N >> 1; k > (i ^= k); k >>= 1);
                        if (i > j) swap(F[i], F[j]);
                }
                C w, s, t;
                for (int i = 1; i < N; i <<= 1) {
                        for (int k = 0; k < i; k++) {
                                w = polar(1.0, PI / i * k);
                                for (int j = 0; j < N; j += i * 2) {
                                        s = F[j + k];
                                        t = C(F[j + k + i].real() * w.real() - F[j + k + i].imag() * w.imag(), F[j + k + i].real() * w.imag() + F[j + k + i].imag() * w.real());
                                        F[j + k] = s + t, F[j + k + i] = s - t;
                                }
                        }
                }
                if (rev) for (int i = 0; i < N; i++) F[i] /= N;
        }

        vector<int64_t> multiply(const vector<int> &A, const vector<int> &B) {
                size_t sz = 1;
                while (sz <= A.size() + B.size()) sz <<= 1;
                vector<C> F(sz), G(sz);
                for (size_t i = 0; i < A.size(); i++) F[i] = A[i];
                for (size_t i = 0; i < B.size(); i++) G[i] = B[i];
                discreteFourierTransform(F, false);
                discreteFourierTransform(G, false);
                for (size_t i = 0; i < sz; i++) F[i] *= G[i];
                discreteFourierTransform(F, true);
                vector<int64_t> X(A.size() + B.size() - 1);
                for (size_t i = 0; i < A.size() + B.size() - 1; i++) X[i] = F[i].real() + 0.5;
                return (X);
        }
};

vector<bool> sieve2(int n) {
        vector<bool> ret(n, 1);
        for (int i = 0; i < min(n, 2); i++) {
                ret[i] = false;
        }
        int lim = int(sqrt(n));
        for (int x = 2; x <= lim; x++) {
                if (ret[x]) {
                        for (int y = x * x; y < n; y += x) {
                                ret[y] = 0;
                        }
                }
        }
        return ret;
}

const int MAX = 6;

void Main() {
        vb P = sieve2(MAX * 2 + 2);
        out(P);

        int n = ri();
        vector<int> A(MAX + 1);
        rep(i, n) A[ri()]++;
        out(A);

        auto B = FastFourierTransform::multiply(A, A);
        out(B);

        ll ans = 0;
        ans += A[1] * (A[1] - 1LL) / 2;

        rep(i, 3, MAX * 2 + 1) {
                if (P[i]) {
                        ans += B[i] / 2;
                }
        }

        cout << ans << endl;
}

signed main() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        Main();
        return 0;
}
# ユーザ名 問題 言語 状態 得点 提出日時
00273 shiratty8 0025 - のえるちゃん選び C++11 RE 0 18-03-23 03:49

セット

# セット 得点 Cases
1 ALL 0 / 15 *

テストケース

テストケース取得

ファイル名 状態 実行時間 メモリ使用量 #
random_01.txt RE 30 ms 1708 KB 1
random_02.txt RE 40 ms 1700 KB 1
random_03.txt WA 30 ms 1592 KB 1
random_04.txt WA 30 ms 1592 KB 1
random_05.txt WA 10 ms 1592 KB 1
random_06.txt RE 10 ms 1524 KB 1
random_07.txt RE 10 ms 1524 KB 1
random_08.txt RE 10 ms 1524 KB 1
random_09.txt RE 20 ms 1524 KB 1
random_10.txt RE 20 ms 1520 KB 1
random_11.txt RE 10 ms 1524 KB 1
random_12.txt RE 20 ms 1520 KB 1
random_13.txt RE 10 ms 1524 KB 1
random_14.txt RE 10 ms 1520 KB 1
random_15.txt RE 40 ms 1708 KB 1
random_16.txt AC 20 ms 1596 KB 1
random_17.txt AC 30 ms 1592 KB 1
sample_01.txt AC 10 ms 1584 KB 1
sample_02.txt AC 20 ms 1584 KB 1
sample_03.txt AC 20 ms 1588 KB 1