【BZOJ3513】[MUTC2013] idiots（FFT）

Description

给定n个长度分别为a_i的木棒，问随机选择3个木棒能够拼成三角形的概率。

---

Solution

我们考虑用FFT算出$b_i$表示有多少种方案取出两根木棒使得它们的长度不大于 i i <script type="math/tex" id="MathJax-Element-80">i</script>。
那么我们对于每个木棒，可以求出有多少对木棒的和不大于它的长度，也就是它们不能拼成三角形，然后就是简单记数了。

---

Code

/************************************************
 * Au: Hany01
 * Date: Apr 9th, 2018
 * Prob: [BZOJ3513] idiots
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 270000;
int rev[maxn], N, cnt;


/FFT
const double pi = acos(-1.);
struct cpx {
    double real, imag;
    cpx(double real = 0, double imag = 0): real(real), imag(imag) {}
};
cpx operator + (cpx A, cpx B) { return cpx(A.real + B.real, A.imag + B.imag); }
cpx operator - (cpx A, cpx B) { return cpx(A.real - B.real, A.imag - B.imag); }
cpx operator * (cpx A, cpx B) { return cpx(A.real * B.real - A.imag * B.imag, A.real * B.imag + A.imag * B.real); }
inline void FFT(cpx* a, int type)
{
    rep(i, N) if (i < rev[i]) swap(a[i], a[rev[i]]);
    for (register int i = 2; i <= N; i <<= 1) {
        register cpx wn = cpx(cos(2 * pi / i), sin(2 * pi / i * type));
        for (register int j = 0; j < N; j += i) {
            register cpx w = cpx(1, 0);
            rep(k, i >> 1) {
                register cpx x = a[j + k], y = a[j + k + (i >> 1)] * w;
                a[j + k] = x + y, a[j + k + (i >> 1)] = x - y, w = w * wn;
            }
        }
    }
}
/FFT


int n, mx, len[maxn];
cpx a[maxn];
LL b[maxn];

int main()
{
#ifdef hany01
    File("bzoj3513");
#endif

    for (static int T = read(); T --; )
    {
        n = read(), Set(a, 0), mx = 0;
        For(i, 1, n)
            ++ a[len[i] = read()].real, chkmax(mx, len[i]);
        for (N = 1, cnt = 0; N <= (mx << 1); N <<= 1, ++ cnt) ;
        rep(i, N) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (cnt - 1));
        FFT(a, 1);
        rep(i, N) a[i] = a[i] * a[i];
        FFT(a, -1);
        rep(i, N) b[i] = floor(a[i].real / N + 0.5);
        For(i, 1, n) -- b[len[i] << 1];
        rep(i, N) assert(!(b[i] & 1)), b[i] >>= 1;
        For(i, 1, N) b[i] += b[i - 1];
        register LL Sum = (LL)n * (LL)(n - 1) * (LL)(n - 2) / 2ll / 3ll, sum = 0;
        For(i, 1, n) sum += b[len[i]];
        printf("%.7lf\n", (double)(Sum - sum) / (double)Sum);
    }

    return 0;
}
//朝真暮伪何人辨，古往今来底事无。
//    -- 白居易《放言五首·其一》