寒假：Day21

Day21

今天进入图论，为了加快进度，我偏向先自己写，如果写得出来就直接跳过了，写不出来的再去看视频。

基础课把这些算法模板都背熟了，提高课直接学习如何建图，这是图论难点。Y总的总结很好用

[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-XP6JjhcQ-1642483693999)(C:\Users\lenovo\AppData\Local\Temp\1642329881043.png)]

1127. 香甜的黄油 - AcWing题库

第一次用spfa，代码确实简洁，但是可能会被卡，所以如果是正权图尽可能还是用Dijkstra比较好防止被卡。

这道题的思路就是枚举每一个牧场，求出以这个牧场为源点到其他牧场的最短距离，然后取最小值即可。

#include<bits/stdc++.h>
using namespace std;
const int N = 3000, INF = 0x3f3f3f3f;
int e[N], ne[N], h[N], w[N], idx;
int id[N], dist[N];
bool st[N];
int n, m, p;

void add(int a, int b, int c)
{
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

int spfa(int x)
{
    memset(dist, 0x3f, sizeof dist);
    queue<int> q;
    q.push(x);
    dist[x] = 0;
    st[x] = 1;
    while (q.size()) {
        int t = q.front();
        q.pop();
        st[t] = false;
        for (int i = h[t]; i != -1; i = ne[i]) {
            int j = e[i];
            if (dist[j] > dist[t] + w[i]) {
                dist[j] = dist[t] + w[i];
                if (!st[j]) {
                    q.push(j);
                    st[j] = true;
                }
            }
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i++) {
        int j = id[i];
        if (dist[j] == INF) return INF;
        res += dist[j];
    }
    return res;
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    memset(h, -1, sizeof h);
    cin >> n >> p >> m;
    for (int i = 1; i <= n; i++) cin >> id[i];
    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c);
        add(b, a, c);
    }
    int ans = 0x3f3f3f3f;
    for (int i = 1; i <= p; i++) ans = min(ans, spfa(i));
    cout << ans << endl ;
    return 0;
}

920. 最优乘车 - AcWing题库

把每一个路线上的点分别连起来边权为1，然后跑一边最短路就可以了

第一次使用stringstream，需要调用sstream库，可以把一行字符通过空格隔开读入，很基础的一个库，需要多加学习这个库的使用，可以说学到新东西了，因为边权是1，所以可以用BFS来写，用数组模拟队列也要多练习。

#include<bits/stdc++.h>
using namespace std;
const int N = 510;

int dist[N], stop[N];
bool g[N][N];
int n, m;
int q[N];

void bfs()
{
    memset(dist, 0x3f, sizeof dist);
    int hh = 0, tt = 0;
    q[0] = 1;
    dist[1] = 0;
    while (hh <= tt) {
        int t = q[hh++];
        for (int i = 1; i <= n; i++)
            if (g[t][i] && dist[i] > dist[t] + 1) {
                dist[i] = dist[t] + 1;
                q[++tt] = i;
            }
    }
}

int main(void)
{
    cin >> m >> n;
    getchar();
    while (m--) {
        string s;
        getline(cin, s);
        stringstream scin(s);
        int p, cnt = 0;
        while (scin >> p) stop[cnt++] = p;
        for (int i = 0; i < cnt; i++)
            for (int j = i + 1; j < cnt; j++)
                g[stop[i]][stop[j]] = 1;
    }
    bfs();
    if (dist[n] == 0x3f3f3f3f) cout << "NO" << endl ;
    else cout << dist[n] - 1 << endl ;
    return 0;
}

903. 昂贵的聘礼 - AcWing题库

建图设一个虚拟源点为起点，这个点到每一个点都有一条边，默认直接够买，所以只需要求从这个源点到1号点的最短距离即可，至于等级制度，只需要枚举等级区间即可，求出这些区间的最小值

#include<bits/stdc++.h>
using namespace std;
const int N = 110, INF = 0x3f3f3f3f;
int n, m;
int w[N][N], level[N];
int dist[N];
bool st[N];

int dijkstra(int down, int up)
{
    memset(dist, 0x3f, sizeof dist);
    memset(st, 0, sizeof st);
    
    dist[0] = 0;
    for (int i = 1; i <= n + 1; i++)
    {
        int t = -1;
        for (int j = 0; j <= n; j++)
            if (!st[j] && (t == -1 || dist[t] > dist[j]))
                t = j;
        st[t] = true;
        for (int j = 1; j <= n; j++)
            if (level[j] >= down && level[j] <= up)
                dist[j] = min(dist[j], dist[t] + w[t][j]);
    }
    return dist[1];
}

int main(void)
{
    cin >> m >> n;
    memset(w, 0x3f, sizeof w);
    for (int i = 1; i <= n; i++) w[i][i] = 0;
    for (int i = 1; i <= n; i++)
    {
        int price, cnt;
        cin >> price >> level[i] >> cnt;
        w[0][i] = min(price, w[0][i]);
        while (cnt--)
        {
            int id, cost;
            cin >> id >> cost;
            w[id][i] = min(cost, w[id][i]);
        }
    }
    int res = INF;
    // 枚举区间，从 [level[1] - m, level[1]] 到 [level[1], level[1] + m]
    for (int i = level[1] - m; i <= level[1]; i++) res = min(res, dijkstra(i, i + m));
    cout << res << endl ;
    return 0;
}

1135. 新年好 - AcWing题库

Dijkstra + dfs，先预处理出每一个点到其他点的最短路，最后在dfs枚举摆放顺序，最后求最小值即可。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
const int N = 50010, M = 200010, INF = 0x3f3f3f3f;
int n, m;
int source[6];
int h[N],e[M], ne[M], w[M], idx;
int q[N], dist[6][N];
bool st[N];

void add(int a, int b, int c)
{
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

void dijkstra(int start, int dist[])
{
    memset(dist, 0x3f, N * 4);
    dist[start] = 0;
    memset(st, 0, sizeof st);
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, start});
    while (heap.size())
    {
        auto t = heap.top();
        heap.pop();
        int ver = t.second;
        if (st[ver]) continue;
        st[ver] = true;
        
        for (int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (dist[j] > dist[ver] + w[i])
            {
                dist[j] = dist[ver] + w[i];
                heap.push({dist[j], j});
            }
        }
    }
}

int dfs(int u, int start, int distance)
{
    if (u > 5) return distance;
    
    int res = INF;
    for (int i = 1; i <= 5; i++)
    {
        if (!st[i])
        {
            int next = source[i];
            st[i] = true;
            res = min(res, dfs(u + 1, i, distance + dist[start][next]));
            st[i] = false;
        }
    }
    return res;
}

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    source[0] = 1;
    for (int i = 1; i <= 5; i++) cin >> source[i];
    memset(h, -1, sizeof h);
    while (m--)
    {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c), add(b, a, c);
    }
    
    for (int i = 0; i < 6; i ++) dijkstra(source[i], dist[i]);
    memset(st, 0, sizeof st);
    cout << dfs(1, 0, 0) << endl ;
    return 0;
}

while (m–)
{
int a, b, c;
cin >> a >> b >> c;
add(a, b, c), add(b, a, c);
}

for (int i = 0; i < 6; i ++) dijkstra(source[i], dist[i]);
memset(st, 0, sizeof st);
cout << dfs(1, 0, 0) << endl ;
return 0;

}