2022“杭电杯”中国大学生算法设计超级联赛（5）补题

1012 Buy Figurines

若干个人依次去买东西，每个人有一个购买时间。有若干个窗口，每个人到时会选择排队人最少的窗口，否则选择最左边的窗口。问需要多少时间买完。 

模拟题，可以线段树维护。

#include<iostream>
#include<algorithm>
#include<queue>
#define int long long
#define lson (p << 1)
#define rson (p << 1 | 1)
using namespace std;
 
const int N = 2e5 + 10;
 
struct people{
    int s, t;
    bool operator < (const people &x) const{
        return s < x.s;
    }
};
 
struct shop{
    int t, i;
    bool operator < (const shop &x) const{
        return t > x.t;
    }
};
 
int n, m;
int time[N], tr[N << 2];
people a[N];
 
void build(int l = 1, int r = m, int p = 1){
    tr[p] = 0;
    if(l == r) return;
    int mid = (l + r) >> 1;
    build(l, mid, lson);
    build(mid + 1, r, rson);
}
 
void update(int x, int y, int l = 1, int r = m, int p = 1){
    if(l == r){
        tr[p] += y;
        return;
    }
    int mid = (l + r) >> 1;
    if(x <= mid) update(x, y, l, mid, lson);
    else update(x, y, mid + 1, r, rson);
    tr[p] = min(tr[lson], tr[rson]);
}
 
int query(int l = 1, int r = m, int p = 1){
    if(l == r) return l;
    int mid = (l + r) >> 1;
    if(tr[lson] <= tr[rson]) return query(l, mid, lson);
    else return query(mid + 1, r , rson);
}
 
void solve(){
    cin >> n >> m;
    for(int i = 1; i <= m; i++) time[i] = 0;
    build();
    for(int i = 1; i <= n; i++){
        cin >> a[i].s >> a[i].t;
    }
    sort(a + 1, a + 1 + n);
    priority_queue<shop> q;
    for(int i = 1; i <= n; i++){
        while(!q.empty() && q.top().t <= a[i].s){
            update(q.top().i, -1);
            q.pop();
        }
        int tmp = query();
        update(tmp, 1);
        q.push({max(time[tmp] + a[i].t, a[i].s + a[i].t), tmp});
        time[tmp] = max(time[tmp] + a[i].t, a[i].s + a[i].t);
    }
    int ans = 0;
    for(int i = 1; i <= m; i++){
        ans = max(ans, time[i]);
    }
    cout << ans << '\n';
}
 
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}

 

1003 Slipper

题意： 求s到t的最短路，其中任意两个点如果深度差等于k，则可以花费p来进行传送。

题解: 在满足深度差的层之间增加新的边，用dijstra跑最短路即可。

#include<iostream>
#include<set>
#include<cstring>
#include<queue>
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
 
const int N = 1e6 + 10;
 
int n, top, s, t, k, p;
int head[N], dep[N], dis[N], vis[N], jump[N];
 
set<int> now[N];
 
struct edge{
    int to, cost, next;
}e[N];
 
struct node{
    int num, dis;
    bool operator < (const node &x) const{
        return dis > x.dis;
    }
};
 
void init(){
    top = 0;
    memset(head, -1, sizeof(head));
    memset(dis, INF, sizeof(dis));
    memset(vis, 0, sizeof(vis));
    memset(jump, 0, sizeof(jump));
    for(int i = 1; i <= n; i++) now[i].clear();
}
 
void add(int u, int v, int w){
    e[top].to = v;
    e[top].cost = w;
    e[top].next = head[u];
    head[u] = top ++;
}
 
void dfs(int u, int fa){
    now[dep[u]].insert(u);
    for(int i = head[u]; ~i; i = e[i].next){
        if(e[i].to == fa) continue;
        dep[e[i].to] = dep[u] + 1;
        dfs(e[i].to, u);
    }
}
 
int dijkstra(){
    priority_queue<node> q;
    q.push({s, 0});
    dis[s] = 0;
    while(!q.empty()){
        int u = q.top().num; q.pop();
        if(vis[u]) continue;
        vis[u] = 1;
        if(u == t) return dis[t];
        for(int i = head[u]; ~i; i = e[i].next){
            int v = e[i].to, w = e[i].cost;
            if(dis[v] > dis[u] + w){
                dis[v] = dis[u] + w;
                q.push({v, dis[v]});
            }
        }
        if(jump[dep[u]]) continue;
        jump[dep[u]] = 1;
        for(auto v : now[dep[u] + k]){
            if(dis[v] > dis[u] + p){
                dis[v] =dis[u] + p;
                q.push({v, dis[v]});
            }
        }
        if(dep[u] - k <= 0) continue;
        for(auto v : now[dep[u] - k]){
            if(dis[v] > dis[u] + p){
                dis[v] =dis[u] + p;
                q.push({v, dis[v]});
            }
        }
    }
    return 0;
}
 
void solve(){
    cin >> n;
    init();
    int u, v, w;
    for(int i = 1; i < n; i++){
        cin >> u >> v >> w;
        add(u, v, w);
        add(v, u, w);
    }
    cin >> k >> p >> s >> t;
    dep[1] = 1; 
    dfs(1, 0);
    cout << dijkstra() << '\n';
}
 
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}