EOJ Monthly 2021.2 Sponsored by TuSimple A、C

B题过了那么多人……没写出来，检讨。
队友说：
对于每个人 起点跑一遍 终点跑一遍 找到所有在最短路径上的点
按宽搜顺序遍历一遍，得到概率。
感觉很对。
A：
题意：树上五点连接成链，求路径上边权值和最小。
思路：
很容易发现，如果连接成环，那么路径上每条边经过两次。
暴力全排列排列，求最小值。
t掉。
考虑成环，所以第一个数是多少无所谓，于是从次高开始全排列。
树上路径用LCA处理

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int n, u, v, w, q, a[5];
vector<pii> edg[maxn];
ll val[maxn];
int du[maxn];
int root;
int f[maxn][23];
int dep[maxn];
void dfs(int x, int p)
{
    dep[x] = dep[p] + 1;
    for(int i = 1; (1 << i) <= dep[x]; i ++)
    {
        f[x][i] = f[f[x][i - 1]][i - 1];
    }
    for(auto t : edg[x])
    {
        if(t.first == p)
            continue;
        f[t.first][0] = x;
        val[t.first] = val[x] + t.second;
        dfs(t.first, x);
    }
}
int lca(int x,int y)
{
    if(dep[x]<dep[y])swap(x,y);
    for(int i=20;i>=0;i--)
    {
        if(dep[f[x][i]]>=dep[y])x=f[x][i];
        if(x==y)return x;
    }
    for(int i=20;i>=0;i--)
    {
        if(f[x][i]!=f[y][i])
        {
            x=f[x][i];y=f[y][i];
        }
    }
    return f[x][0];
}
int l;
int main()
{
    scanf("%d", &n);
    for(int i = 0; i < n; i ++)
    {
        for(int j = 0; j <= 22; j ++)
            f[i][j] = -1;
        dep[i] = val[i] = du[i] = 0;
        edg[i].clear();
    }
    for(int i = 1; i < n; i ++)
    {
        scanf("%d%d%d", &u, &v, &w);
        edg[u].pb(mp(v, w));
        edg[v].pb(mp(u, w));
        du[u] ++;
        du[v] ++;
    }
    for(int i = 0; i < n; i ++)
    {
        if(du[i] > 1)
        {
            root = i;
            break;
        }
    }
    dfs(root, root);
    scanf("%d", &q);
    while(q --)
    {
        for(int i = 0; i < 5; i ++)
            scanf("%d", &a[i]);
        sort(a, a + 5);
        ll ans = INF;
        do
        {
            ll res = 0;
            for(int i = 1; i < 5; i ++)
            {
                l = lca(a[i], a[i - 1]);
                res += val[a[i]] + val[a[i - 1]] - 2 * val[l];
            }
            l = lca(a[0] , a[4]);
            res += val[a[0]] + val[a[4]] - 2 * val[l];
            ans = min(ans, res);
        }
        while(next_permutation(a + 1, a + 5));
        printf("%lld\n", ans / 2);
    }
    return 0;
}

C:
题意：给区间最小值，还原排列
思路：线段树维护区间最小值，并根据各值区间判断是否合法，最后构造就可

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define mp make_pair
#define pb push_back
#define mt(a,val) memset(a,val,sizeof(a))
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = 3.14159265;
const int maxn = 3e5 + 7;
int n, q;
int l, r, val;
int flag;
int num[maxn];
int ok;
int c[maxn];
int ans[maxn];
int cnt;
int vis[maxn];
vector <int> ind[maxn];
bool cmp(int x, int y)
{
    return (ans[x] == -1 && ans[y] == -1)? num[x] < num[y] : ans[x] < ans[y];
}
pii qq[maxn];
ll tree[maxn << 2];
ll lazy[maxn << 2];
ll lc (ll p)
{
    return p << 1;
}
ll rc (ll p)
{
    return p << 1 | 1;
}
void pushup (ll p)
{
    tree[p] = min( tree[lc(p)] ,  tree[rc(p)] );
}
void build (ll p, ll l, ll r)
{
    lazy[p] = -1;
    if(l == r)
    {
        tree[p] = -1;
        return ;
    }
    ll mid = l + r >> 1;
    build(lc(p), l, mid);
    build(rc(p), mid + 1, r);
    pushup(p);
}
void fuc(ll p, ll l, ll r, ll val)
{
    lazy[p] = max(lazy[p], val);//lazy更新
    tree[p] = max(tree[p], val); //sum更新
}
void pushdown(ll p, ll l, ll r)
{
    ll mid = l + r >> 1;
    fuc(lc(p), l, mid, lazy[p]);
    fuc(rc(p), mid + 1, r, lazy[p]);
    lazy[p] = -1;
}
bool update(ll p, ll nl, ll nr, ll l, ll r, ll val)
{
    if(nl <= l && r <= nr)
    {
        tree[p] = max(tree[p], val); //sum
        lazy[p] = max(lazy[p], val); //update lazy
        if(tree[p] <= val)
            return true;
        else
            return false;
    }
    pushdown(p, l, r);
    ll mid = l + r >> 1;
    bool res = 1;
    if(nl <= mid)
        res = min(res, update(lc(p), nl, nr, l, mid, val) );
    if(nr > mid)
        res = min(res, update(rc(p), nl, nr, mid + 1, r, val) );
    pushup(p);
    return res;
}
ll query(ll p, ll nl, ll nr, ll l, ll r)
{
    ll res = 0;
    if(nl <= l && r <= nr)
        return tree[p];
    ll mid = l + r >> 1;
    pushdown(p, l, r);
    if(nl <= mid)
        res += query(lc(p), nl, nr, l, mid);
    if(nr > mid)
        res += query(rc(p), nl, nr, mid + 1, r);
    return res;
}
int main()
{
    scanf("%d%d", &n, &q);
    flag = 1;
    for(int i = 0; i < n; i ++)
        num[i] = ans[i] = -1, c[i] = i, vis[i] = 0, qq[i].first = -1, qq[i].second = n;
    build(1, 0, n - 1);
    for(int i = 0; i < q; i ++)
    {
        scanf("%d%d%d", &l, &r, &val);
        if(val >= n)
            flag = 0;
        if(val < 0)
            flag = 0;
        if(l > r)
            swap(l, r);
        if(l > qq[val].second || r < qq[val].first)
            flag = 0;
        else
        {
            qq[val].first = max(l , qq[val].first);
            qq[val].second = min(r, qq[val].second);
        }
        update(1, l, r, 0, n - 1, val);
    }
    //判断区间合法
    for(int i = 0; i < n; i ++)
    {
        num[i] = query(1, i, i, 0, n - 1);
    }
    for(int i = 0; i < n; i ++)
        if(num[i] != -1)
            ind[num[i]].pb(i);
    for(int i = 0; i < n; i ++)
    {
        if(qq[i].first != -1)
        {
            ok = 0;
            for(auto tt : ind[i])
            {
                if(tt >= qq[i].first && tt <= qq[i].second)
                {
                    ok = 1;
                    ans[tt] = i;
                    vis[i] = 1;
                    break;
                }
            }
            if(!ok)
                flag = 0;
        }
    }
    //构造
    cnt = 0;
    sort(c, c + n, cmp);
    for(int i = 0; i < n; i ++)
    {
        int j = c[i];
        if(ans[j] == -1)
        {
            while(vis[cnt])
                cnt ++;
            if(cnt > num[j])
            {
                ans[j] = cnt;
                vis[cnt] = 1;
            }
            else
                flag = 0;
        }
    }
    if(!flag)
    {
        for(int i = 0; i < n; i ++)
        {
            if(i)
                printf(" ");
            printf("-1");
        }
        printf("\n");
    }
    else
    {
        for(int i = 0; i < n; i ++)
        {
            if(i)
                printf(" ");
            printf("%d", ans[i]);
        }
        printf("\n");
    }

    return 0;
}
// 100 1 1 1 0