主函数都是完全一样的而且也都开了longlong

#include <cstdio>
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <cassert>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define vi vector<int>
#define vll vector<ll>
#define vd vector<double>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpd vector<pdd>
#define st set<int>
#define mset(a, b) memset(a, b, sizeof(a))
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define repi(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define debug(x) cerr << #x << '=' << (x) << endl
#define repdebug(i, n) cerr << #i << '=' << (i) << endl
#define debugall(a)            \
    cerr << #a << '=' << endl; \
    for (auto x : a)           \
        cerr << x << ' ';      \
    cerr << endl
#define IOS                      \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0)
#define endl '\n'
#define endll endl << '\n'
#define endi endl << ' '
#define endd endl << ' '
#define endall(a)         \
    for (auto x : a)      \
        cerr << x << ' '; \
    cerr << endl
#define INF 0x3f3f3f3f

const int maxn = 1e5 + 5, maxm = 1e3 + 5, maxq = 1e7 + 5;
const int mod = 1e9 + 7;

ll n, m, k, t, u, v, i, j, ans, res, mid, cnt, tmp, sum, l, r;
ll arr[maxn], c[maxn], s[maxn], p[maxn];

int max(ll a, ll b) { return a > b ? a : b; }
int min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll power(ll a, ll b)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

int main()
{
    IOS;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
        cin >> arr[i];
    memset(c, 0, sizeof(c));
    memset(s, 0, sizeof(s));
    for (i = 1; i <= m - 1; i++)
    {
        r = max(arr[i], arr[i + 1]);
        l = min(arr[i], arr[i + 1]);
        c[l]++;
        c[r]--;
    }
    for (i = 1; i <= n - 1; i++)
        s[i] = s[i - 1] + c[i];
    ans = 0;
    for (i = 1; i <= n - 1; i++)
    {
        cin >> t >> u >> v;
        ans += min(t * s[i], v + u * s[i]);
    }
    cout << ans;
    return 0;
}

这行代码只拿了70

然后我把上面那一堆删掉

#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

ll n, m, ans, i, r, l, t, u, v;
ll arr[100005], c[100005], s[100005];

int main()
{
    IOS;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
        cin >> arr[i];
    memset(c, 0, sizeof(c));
    memset(s, 0, sizeof(s));
    for (i = 1; i <= m - 1; i++)
    {
        r = max(arr[i], arr[i + 1]);
        l = min(arr[i], arr[i + 1]);
        c[l]++;
        c[r]--;
    }
    for (i = 1; i <= n - 1; i++)
        s[i] = s[i - 1] + c[i];
    ans = 0;
    for (i = 1; i <= n - 1; i++)
    {
        cin >> t >> u >> v;
        ans += min(t * s[i], v + u * s[i]);
    }
    cout << ans;
    return 0;
}

然后AC了。。。有没有佬说一下为啥？