OI-Problems/ABC375F.cpp at main · WRT-Partisan/OI-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/*
 * @FilePath: \c++\ABC375F.cpp
 * @Author: WRT_Partisan
 * @Date: 2025-10-04 14:59:15
 */
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef unsigned long long ull;
constexpr int INF = 0x3f3f3f3f3f3f3f3f;
struct Edge
{
    int u, v, w;
} e[500005];
struct Ask
{
    int op, u, v;
} ask[500005];
bool book[500005];
int n, m, q, ans[500005], cnt, dis[305][305];
signed main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
        cin >> e[i].u >> e[i].v >> e[i].w;
    for (int i = 1; i <= q; i++)
    {
        cin >> ask[i].op >> ask[i].u;
        if (ask[i].op == 1)
            book[ask[i].u] = 1;
        else
            cin >> ask[i].v;
    }
    reverse(ask + 1, ask + q + 1);
    memset(dis, 0x3f, sizeof(dis));
    for (int i = 1; i <= n; i++)
        dis[i][i] = 0;
    for (int i = 1; i <= m; i++)
        if (!book[i])
            dis[e[i].u][e[i].v] = dis[e[i].v][e[i].u] = min(dis[e[i].u][e[i].v], e[i].w);
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
    for (int i = 1; i <= q; i++)
    {
        if (ask[i].op == 1)
        {
            int u = e[ask[i].u].u, v = e[ask[i].u].v, w = e[ask[i].u].w;
            dis[u][v] = dis[v][u] = min(dis[u][v], w);
            for (int i = 1; i <= n; i++)
                for (int j = 1; j <= n; j++)
                    dis[i][j] = min({dis[i][j], dis[i][u] + w + dis[v][j], dis[i][v] + w + dis[u][j]});
        }
        else
            ans[++cnt] = dis[ask[i].u][ask[i].v];
    }
    reverse(ans + 1, ans + cnt + 1);
    for (int i = 1; i <= cnt; i++)
        cout << (ans[i] == INF ? -1 : ans[i]) << "\n";
    return 0;
}