SRM603

上一套题太那个了，弃坑。
500pts:
我们可以发现A和B要循环同构。
那么枚举循环节，计算个数即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5, P = 1e9 + 7;
ll ans;
ll a[maxn], dp[maxn];
class PairsOfStrings {
    public:
        ll power(ll x, ll t) {
            ll ret = 1;
            for(; t; t >>= 1, x = x * x % P) {
                if(t & 1) {
                    ret = ret * x % P;
                }
            }
            return ret;
        }
        int getNumber(int n, int k) {
            for(int i = 1; i * i <= n; ++i) {
                if(n % i == 0) {
                    a[++a[0]] = i;
                    if(i * i != n) {
                        a[++a[0]] = n / i;
                    }
                }
            }
            sort(a + 1, a + a[0] + 1);
            for(int i = 1; i <= a[0]; ++i) {
                dp[i] = power(k, a[i]);
            }
            for(int i = 1; i <= a[0]; ++i) {
                for(int j = 1; j < i; ++j) {
                    if(a[i] % a[j] == 0) {
                        dp[i] = (dp[i] - dp[j] + P) % P;
                    }
                }
                ans = (ans + dp[i] * a[i] % P) % P;
            }
            return (int)ans;
        }
};

1000pts:
可以转化成这样一个问题，统计出所有二元组构成的权值数量，很明显每种权值的数量都可以由某种排列构成。先把出现次数比$10$大的暴力统计，其他的用fft即可。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
const int maxn = 3e5 + 5;
const double pi = acos(-1);
struct cp {
    double x, y;
    cp() {}
    cp(double _x, double _y) : x(_x), y(_y) {}
    cp friend operator + (const cp &a, const cp &b) {
        return cp(a.x + b.x, a.y + b.y);
    }
    cp friend operator - (const cp &a, const cp &b) {
        return cp(a.x - b.x, a.y - b.y);
    }
    cp friend operator * (const cp &a, const cp &b) {
        return cp(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x);
    }
} f[maxn], g[maxn];
int n, len, tot1, tot2;
int cnt1[maxn], cnt2[maxn], a[maxn], b[maxn], p1[maxn], p2[maxn];
long long ans[maxn];
void fft(cp *a, int f) {
    for(int i = 0; i < n; ++i) {
        int t = 0;
        for(int j = 0; j < len; ++j) {
            if(i >> j & 1) {
                t |= 1 << (len - j - 1);
            }
        }
        if(i < t) {
            swap(a[i], a[t]);
        }
    }
    for(int l = 2; l <= n; l <<= 1) {
        int m = l >> 1;
        cp t = cp(cos(pi / m), f * sin(pi / m));
        for(int i = 0; i < n; i += l) {
            cp w = cp(1, 0);
            for(int k = 0; k < m; ++k, w = w * t) {
                cp x = a[i + k], y = w * a[i + m + k];
                a[i + k] = x + y;
                a[i + m + k] = x - y;
            }
        }
    }
    if(f == -1) {
        for(int i = 0; i < n; ++i) {
            a[i].x /= n;
        }
    }
}
class SumOfArrays {
    public:
        string findbestpair(int N, vector<int> A, vector<int> B) {
            a[0] = A[0];
            a[1] = A[1];
            b[0] = B[0];
            b[1] = B[1];
            for(int i = 2; i < N; ++i) {
                a[i] = (1LL * a[i - 1] * A[2] + 1LL * a[i - 2] * A[3] + A[4]) % A[5];
                b[i] = (1LL * b[i - 1] * B[2] + 1LL * b[i - 2] * B[3] + B[4]) % B[5];
            }
            for(int i = 0; i < N; ++i) {
                ++cnt1[a[i]];
                ++cnt2[b[i]];
            }
            for(int i = 0; i < maxn; ++i) {
                if(cnt1[i] > 10) {
                    p1[++tot1] = i;
                }
                if(cnt2[i] > 10) {
                    p2[++tot2] = i;
                }
            }
            for(int i = 1; i <= tot1; ++i) {
                for(int j = 1; j <= tot2; ++j) {
                    ans[p1[i] + p2[j]] += min(cnt1[p1[i]], cnt2[p2[j]]) - 10;
                }
            }
            for(n = 1, len = 0; n <= 2 * N; n <<= 1) {
                ++len;
            }
            for(int i = 1; i <= 10; ++i) {
                memset(f, 0, sizeof(f));
                memset(g, 0, sizeof(g));
                for(int j = 0; j < 100000; ++j) {
                    if(cnt1[j] >= i) {
                        f[j].x = 1.0;
                    }
                    if(cnt2[j] >= i) {
                        g[j].x = 1.0; 
                    }
                }
                fft(f, 1);
                fft(g, 1);
                for(int i = 0; i < n; ++i) {
                    f[i] = f[i] * g[i];
                }
                fft(f, -1);
                for(int i = 0; i < maxn; ++i) {
                    ans[i] += (int)(f[i].x + 0.1); 
                }
            }
            int p = 0;
            for(int i = 0; i < maxn; ++i) {
                if(ans[i] >= ans[p]) {
                    p = i;
                }
            }
            char ret[25];
            sprintf(ret, "%lld %d", ans[p], p);
            return ret;
        }
};