結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー tokusakurai
提出日時 2020-12-17 12:36:57
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 196 ms / 2,000 ms
コード長 2,865 bytes
コンパイル時間 2,338 ms
コンパイル使用メモリ 207,616 KB
最終ジャッジ日時 2025-01-17 02:24:28
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 57
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;
template<typename T>
struct Weighted_Graph{
    struct edge{
        int to; T cost; int id;
        edge(int to, T cost, int id) : to(to), cost(cost), id(id) {}
    };
    vector<vector<edge>> es;
    vector<T> d;
    vector<int> pre_v;
    vector<int> keep;
    int ng;
    const T INF_T;
    const int n;
    Weighted_Graph(int n) : INF_T(numeric_limits<T>::max()>>1), n(n){
        es.resize(n), d.resize(n), pre_v.resize(n);
    }
    void add_edge(int from, int to, T cost, int id, bool directed = false){
        es[from].eb(to, cost, id);
        if(!directed) es[to].eb(from, cost, id);
    }
    T dijkstra(int s, int t = 0){
        fill(all(d), INF_T);
        using P = pair<T, int>;
        priority_queue<P, vector<P>, greater<P> > que;
        que.emplace(d[s] = 0, s);
        while(!que.empty()){
            auto [p, i] = que.top(); que.pop();
            if(p > d[i]) continue;
            each(e, es[i]){
                if(e.id == ng) continue;
                if(chmin(d[e.to], d[i]+e.cost)){
                    pre_v[e.to] = i, que.emplace(d[e.to], e.to);
                }
            }
        }
        return d[t];
    }
    vector<int> shortest_path(int s, int t){
        keep.clear();
        if(dijkstra(s, t) == INF_T) return keep;
        for(int now = t; now != s; now = pre_v[now]) keep.pb(now);
        keep.pb(s), reverse(all(keep));
        return keep;
    }
    T query(int u, int v, int id){
        ng = id;
        return dijkstra(u, v);
    }
};
int main(){
    int T;
    cin >> T;
    int N, M;
    cin >> N >> M;
    vector<int> u(M), v(M);
    vector<ll> c(M);
    Weighted_Graph<ll> G(N);
    rep(i, M){
        cin >> u[i] >> v[i] >> c[i];
        u[i]--, v[i]--;
        G.add_edge(u[i], v[i], c[i], i, T);
    }
    ll ans = INF;
    rep(i, M){
        chmin(ans, c[i]+G.query(v[i], u[i], i));
    }
    cout << (ans >= INF? -1 : ans) << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0