牛客训练赛46

A
直接推公式

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int s;
    cin >> s;
    printf("%.3f\n", 2.0 * sqrt(s / acos(-1.0)));
}

B
设sum_a为a的前缀和，sum_b为b的前缀和。则以(x1,y1)为左上角，以(x2,y2)为右下角的矩阵的权值为(sum_a[x2]-sum_a[x1-1])(sum_b[y2]-sum_b[y1-1])，其中要满足x1<=x2,y1<=y2。x1,x2的选择与y1,y2的选择相互独立。可以预处理所有y1,y2的组合，然后排序。接下来枚举x1,x2，对y二分即可。复杂度n^2log(m^2)

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e3 + 5;
const ll inf = 10000000000000000;

int a[maxn], b[maxn];
ll suma[maxn], sumb[maxn];
ll sum[maxn * maxn];
int main()
{
    int n, m;
    ll l, r;
    scanf("%d%d%lld%lld", &n, &m, &l, &r);
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]), suma[i] = suma[i - 1] + a[i];
    for(int i = 1; i <= m; ++i) scanf("%d", &b[i]), sumb[i] = sumb[i - 1] + b[i];
    int tot = 0;
    for(int i = 1; i <= m; ++i) {
        for(int j = i; j <= m; ++j) {
            sum[tot++] = sumb[j] - sumb[i - 1];
        }
    }
    sort(sum, sum + tot);
    ll ans = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = i; j <= n; ++j) {
            ll now = suma[j] - suma[i - 1];
            if(now > r) break;
            //int lower = lower_bound(sum, sum + tot, l / now) - sum;
            //int upper = lower_bound(sum, sum + tot, r / now + 1) - sum;
            //cout << lower << "->" << upper << endl;
            int lef = 0, rig = tot, lower, upper;
            while(lef < rig) {
                int mid = lef + (rig - lef) / 2;
                if(now * sum[mid] >= l) rig = mid;
                else lef = mid + 1;
            }
            lower = lef;
            rig = 0, rig = tot;
            while(lef < rig) {
                int mid = lef + (rig - lef) / 2;
                if(now * sum[mid] > r) rig = mid;
                else lef = mid + 1;
            }
            upper = lef;
            ans += upper - lower;
        }
    }
    printf("%lld\n", ans);
}
/*
6 9 3
4 6 2
6 9 3
cout << "(i, j) = " << i << ", " << j << " :" << now << endl;

*/

C

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int n, m, k, a, b;
ll ret1, ret2;
struct Matrix {
    ll a[4][4];
    int r, c; //r竖排 c横排
};
Matrix multi(Matrix x, Matrix y) {
    Matrix ans;
    for (register int i = 0; i < x.r; i++) {
        for (register int j = 0; j < y.c; j++) {
            ans.a[i][j] = 0;
            for (register int k = 0; k < x.c; k++)
                ans.a[i][j] = (ans.a[i][j] + x.a[i][k] * y.a[k][j]) % mod;
        }
    }
    ans.r = x.r;
    ans.c = y.c;
    return ans;
}
ll MatQP(ll l) {
    Matrix p, q;
    memset(p.a, 0, sizeof(p.a));
    p.a[0][0] = ret1, p.a[0][1] = 0, p.a[1][0] = ret2, p.a[1][1] = 1;
    p.c = p.r = 2;
    //构建中间矩阵
    q.a[0][0] = n, q.a[0][1] = 1;
    q.r = 1, q.c = 2;
    //开始矩阵
    while (l) {
        if (l & 1) q = multi(q, p);
        l >>= 1;
        p = multi(p, p);
    }
    return q.a[0][0];
}
ll qpow(ll a, ll b) {
    ll res = 1;
    while(b) {
        if(b & 1) res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
int main()
{
    scanf("%d%d%d%d%d", &n, &m, &k, &a, &b);
    ret1 = (n + m) * qpow(n + m + 1, mod - 2) % mod;
    ret2 = ret1 * a % mod * qpow(b, mod - 2) % mod;
    cout << MatQP(k) << endl;
}