#1193917 (C++17) No.3784 01 Walk

• 問題: No.3784 01 Walk
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-10-21 01:56:14
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 576 ms / 2,000 ms
• コード長: 6,349 bytes
• コンパイル時間: 3,526 ms
• コンパイル使用メモリ: 235,588 KB
• 実行使用メモリ: 56,756 KB
• 最終ジャッジ日時: 2026-10-30 20:57:27
• 合計ジャッジ時間: 31,943 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge7_0

ファイルパターン	結果
sample	AC * 2
other	AC * 40

ソースコード

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> u(M);
    vector<ll> v(M);
    vector<ll> c(M);
    rep(i, M){
        cin >> u[i] >> v[i] >> c[i];
        u[i]--;
        v[i]--;
    }
    // graph の scc をしたい！
    scc_graph graph(2 * N);
    rep(i, M){
        graph.add_edge(u[i], v[i] + N);
        graph.add_edge(u[i] + N, v[i]);
    }
    vector<vector<int>> scc_g = graph.scc();
    ll len = scc_g.size();
    vector<ll> idx(2 * N);
    rep(i, scc_g.size()){
        for (ll x: scc_g[i]){
            idx[x] = i;
        }
    }
    vector<ll> ld(len);
    rep(i, len){
        ld[i] = scc_g[i][0];
    }

    vector<vector<pll>> g1(2 * N, vector<pll>(0));
    vector<vector<pll>> g2(len, vector<pll>(0));
    for (ll i = 0; i < M; i++){
        if (idx[u[i]] == idx[v[i] + N]){
            g1[u[i]].push_back(make_pair(v[i] + N, 2 * c[i] - 1));
        }
        else{
            g2[idx[u[i]]].push_back(make_pair(2 * i, 2 * c[i] - 1));
        }
        if (idx[u[i] + N] == idx[v[i]]){
            g1[u[i] + N].push_back(make_pair(v[i], 1 - 2 * c[i]));
        }
        else{
            g2[idx[u[i] + N]].push_back(make_pair(2 * i + 1, 1 - 2 * c[i]));
        }
    }

    // g1, g2 それぞれで閉路が発生するか調べる
    vector<bool> has(len, false);
    vector<bool> isvisited(2 * N, false);
    vector<ll> now_c(2 * N, 0);
    for (ll i = 0; i < 2 * N; i++){
        if (isvisited[i]) continue;
        queue<ll> que;
        que.push(i);
        isvisited[i] = true;
        while (que.size()){
            ll p = que.front();
            que.pop();
            for (pll x: g1[p]){
                ll np = x.first;
                ll nc = x.second;
                if (isvisited[np]){
                    if (now_c[np] != now_c[p] + nc){
                        has[idx[p]] = true;
                    }
                    continue;
                }
                isvisited[np] = true;
                now_c[np] = now_c[p] + nc;
                que.push(np);
            }
        }
    }
    // debug(scc_g);

    ll INF = 1000000000023LL;
    vector<ll> max_val(2 * N, -INF);
    vector<ll> min_val(2 * N, INF);
    max_val[0] = 0;
    min_val[0] = 0;
    max_val[N] = 0;
    min_val[N] = 0;
    for (ll i = 0; i < len; i++){
        ll max_diff = -INF;
        ll min_diff = INF;
        for (int x: scc_g[i]){
            max_diff = max(max_diff, max_val[x] - now_c[x]);
            min_diff = min(min_diff, min_val[x] - now_c[x]);
        }
        for (int x: scc_g[i]){
            max_val[x] = max_diff + now_c[x];
            min_val[x] = min_diff + now_c[x];
        }

        for (pll x: g2[i]){
            ll id = x.first / 2;
            ll type = x.first % 2;
            ll from = u[id];
            ll to = v[id];
            ll nc = x.second;
            if (type == 0) to += N;
            else from += N;
            // debug_out(from, to);
            max_val[to] = max(max_val[to], max_val[from] + nc);
            min_val[to] = min(min_val[to], min_val[from] + nc);
            if (has[i]) has[idx[to]] = true;
        }
    }
    // debug(min_val);
    // debug(max_val);
    for (ll i = 0; i < N; i++){
        if (has[idx[i]]){
            cout << -1 << endl;
            continue;
        }
        ll ans = 0;
        ans = max(ans, max_val[i]);
        ans = max(ans, max_val[i + N]);
        ans = max(ans, -min_val[i]);
        ans = max(ans, -min_val[i + N]);
        cout << ans << endl;
    }
}