日记

Tue Dec 24 2024

8 分钟

life 日记

1101 字

我又双叒叕断更辣！

其实前面 $3$ 天都差点更了。

上午 Link to 上午

考试。
不过这个考试还算是正常的考试，因为分数也是十分正常。
然而，我的 T1 因为没开 long long 爆了 $60$ 分。

考试链接没有题解

T1 Link to T1

如上文所说：因为没开 long long 爆了 $60$ 分。

但是赛时代码是这样的：

CPP

#include<bits/extc++.h>
#define ll long long
// #define LOCAL
using namespace std;
const int maxn = 1.5e5 + 5;
int n,q;
ll a[maxn],b[maxn];
ll pre[maxn],sum;
signed main()
{
    #ifdef LOCAL
    freopen("perm.in","r",stdin);
    freopen("perm.out","w",stdout);
    #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = a[i];
    }
    cin >> q;
    sort(b + 1,b + n + 1);
    for (int i = 1; i <= n; i++)
    {
        sum += b[i] * i;
        pre[i] = pre[i - 1] + b[i];
    }
    int x,y;
    while (q--)
    {
        cin >> x >> y;
        if (a[x] < y)
        {
            int l = lower_bound(b + 1,b + n + 1,a[x]) - b;
            int r = lower_bound(b + 1,b + n + 1,y) - b - 1;
            ll tmp = sum - l * a[x] + r * y;
            tmp -= pre[r] - pre[l];
            cout << tmp << endl;
        }
        else if (a[x] > y)
        {
            int l = lower_bound(b + 1,b + n + 1,y) - b;
            int r = lower_bound(b + 1,b + n + 1,a[x]) - b;
            ll tmp = sum - r * a[x] + l * y;
            tmp += pre[r - 1] - pre[l - 1];
            cout << tmp << endl;
        }
        else
            cout << sum << endl;
    }
    #ifdef LOCAL
    fclose(stdout);
    cout << clock();
    #endif
    return 0;
}

改正后的代码是这样的：

CPP

#include<bits/extc++.h>
#define int long long
// #define LOCAL
using namespace std;
const int maxn = 1.5e5 + 5;
int n,q;
int a[maxn],b[maxn];
int pre[maxn],sum;
signed main()
{
    #ifdef LOCAL
    freopen("perm.in","r",stdin);
    freopen("perm.out","w",stdout);
    #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = a[i];
    }
    cin >> q;
    sort(b + 1,b + n + 1);
    for (int i = 1; i <= n; i++)
    {
        sum += b[i] * i;
        pre[i] = pre[i - 1] + b[i];
    }
    int x,y;
    while (q--)
    {
        cin >> x >> y;
        if (a[x] < y)
        {
            int l = lower_bound(b + 1,b + n + 1,a[x]) - b;
            int r = lower_bound(b + 1,b + n + 1,y) - b - 1;
            int tmp = sum - l * a[x] + r * y;
            tmp -= pre[r] - pre[l];
            cout << tmp << endl;
        }
        else if (a[x] > y)
        {
            int l = lower_bound(b + 1,b + n + 1,y) - b;
            int r = lower_bound(b + 1,b + n + 1,a[x]) - b;
            int tmp = sum - r * a[x] + l * y;
            tmp += pre[r - 1] - pre[l - 1];
            cout << tmp << endl;
        }
        else
            cout << sum << endl;
    }
    #ifdef LOCAL
    fclose(stdout);
    cout << clock();
    #endif
    return 0;
}