Codeforces div.2 ICPC M - Moving Both Hands

题意：给定一个有向图，求1-（2~n）的点的距离，如果走不到则输出-1

思路：由于两个点必定在某一点汇合，其间终点走沿着路径的反向边，因此，我们建一个分层图，两个层之间的顶点对应连长度为0的边，其中一个是正向的图，另一个是反向的图，因此，两个图之间的从正向图的起点，走到反向图的对应终点，即是ans，我们做一下dijkstra，求单源最短路就行了。

注： 该题卡常，一下代码需要优化常数，如果需要验ac，见以下链接

(13条消息) cf-1725 M. Moving Both Hands（反图+dij）_Σ_aphasia的博客-CSDN博客

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int h[N], e[M], ne[M], w[M], idx;
ll dist[N];
bool st[N];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll mod) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

inline void init() {}

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

void dijkstra(int s)
{
    for (int i = 1; i <= n * 2; i++) dist[i] = LLINF;

    priority_queue<PLL, vector<PLL>, greater<PLL> > heap;
    dist[s] = 0;
    heap.push({ dist[s],s });

    while (heap.size()) {
        PLL u = heap.top(); heap.pop();
        ll ver = u.y, distance = u.x;

        if (st[ver])continue;
        st[ver] = true;

        for (int i = h[ver]; ~i; i = ne[i])
        {
            int j = e[i];
            if (dist[j] > distance + w[i])
            {
                dist[j] = distance  + w[i];
                heap.push({dist[j],j});
            }
        }
    }
}

void slove()
{
    cin >> n >> m;
    for (int i = 1; i <= 2 * n; i++)h[i] = -1;
    int a, b, c;
    pre(i, 1, m)
    {
        si(a); si(b); si(c);
        add(a, b, c);
        add(b + n, a + n, c);
    }
    
    pre(i, 1, n) add(i, i + n, 0);

    dijkstra(1);

    pre(i, 2, n) {
        if (dist[n + i] == LLINF)printf("-1 ");
        else printf("%lld ", dist[i + n]);
    }
    return;
}

signed main()
{
    int _;
    //si(_);
    _ = 1;
    init();
    while (_--)
    {
        slove();
    }
    return 0;
}