#595330 (C++14) No.1320 Two Type Min Cost Cycle

• 問題: No.1320 Two Type Min Cost Cycle
• ユーザー: sahiya
• 提出日時: 2020-12-19 14:15:16
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 204 ms / 2,000 ms
• コード長: 2,246 bytes
• コンパイル時間: 1,538 ms
• コンパイル使用メモリ: 120,224 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-21 10:14:55
• 合計ジャッジ時間: 4,935 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 57

ソースコード

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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
typedef bitset<16> BS;
struct edge {
    int from, to, id;
    ll cost;
};
const ll MOD = 1E+09 + 7;
const ll INF = 1E18;
const int MAX_N = 2000;
int T, N, M;
vector<edge> G[MAX_N + 1];
ll d[MAX_N + 1];
edge E[MAX_N + 1];
void dijkstra(int s, int nid);
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> T >> N >> M;
    for (int i = 1; i <= M; i++) {
        int u, v;
        ll w;
        cin >> u >> v >> w;
        G[u].push_back(edge { u, v, i, w });
        if (T == 0) {
            G[v].push_back(edge { v, u, i, w });
        }
        E[i] = edge { u, v, i, w };
    }
    ll ans = INF;
    for (int id = 1; id <= M; id++) {
        fill(d + 1, d + N + 1, INF);
        int from = E[id].from, to = E[id].to;
        ll c = E[id].cost;
        dijkstra(to, id);
        ans = min(ans, d[from] + c);
    }
    /*
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
        }
    }
    */
    if (ans == INF) {
        cout << -1 << "\n";
    } else {
        cout << ans << "\n";
    }
    return 0;
}
void dijkstra(int s, int nid)
{
    priority_queue<P, vector<P>, greater<P>> que;
    que.push(P(0, s));
    d[s] = 0;
    while (!que.empty()) {
        P p = que.top();
        int v = p.second;
        que.pop();
        if (d[v] < p.first)
            continue; //被った頂点に関しては更新前の古いデータはとばす
        for (int i = 0; i < G[v].size(); i++) {
            edge e = G[v][i];
            if (d[e.to] > d[v] + e.cost && e.id != nid) {
                d[e.to] = d[v] + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX