#1169775 (C++17) No.2916 累進コスト最小化

• 問題: No.2916 累進コスト最小化
• ユーザー: 👑 AngrySadEight
• 提出日時: 2026-06-28 14:20:29
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,405 bytes
• コンパイル時間: 2,799 ms
• コンパイル使用メモリ: 217,080 KB
• 実行使用メモリ: 12,008 KB
• 最終ジャッジ日時: 2026-06-28 14:20:35
• 合計ジャッジ時間: 5,983 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge1_0

ファイルパターン	結果
other	AC * 11 WA * 23

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:168:43: warning: 'to' may be used uninitialized [-Wmaybe-uninitialized]
  168 |                     dist[to] = max(dist[to], dist[max_id] - cost);
      |                                           ^
main.cpp:164:20: note: 'to' was declared here
  164 |                 ll to;
      |                    ^~

ソースコード

#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;
    }
}

const ll INF = 10000000000000023LL;

int main() {
    ll N, M, C;
    cin >> N >> M >> C;
    vector<ll> u(M);
    vector<ll> v(M);
    vector<ll> r(M);
    vector<ll> w(M);
    rep(i, M){
        cin >> u[i] >> v[i] >> r[i] >> w[i];
        u[i]--;
        v[i]--;
    }
    vector<vector<ll>> ids(N, vector<ll>(0));
    for (ll i = 0; i < M; i++){
        ids[u[i]].push_back(i);
        ids[v[i]].push_back(i);
    }
    // ダイクストラ法でやる
    for (ll i = 1; i <= C; i++){
        vector<ll> dist(N, -INF);
        dist[0] = i;
        vector<bool> chosen(N, false);
        for (ll j = 0; j < N; j++){
            ll max_dist = -INF;
            ll max_id = -1;
            for (ll k = 0; k < N; k++){
                if (!chosen[k]){
                    if (max_dist < dist[k]){
                        max_id = k;
                        max_dist = dist[k];
                    }
                }
            }
            if (max_id == -1) break;
            chosen[max_id] = true;
            for (ll k = 0; k < ids[max_id].size(); k++){
                ll id = ids[max_id][k];
                ll cost = dist[max_id] / r[id] + w[id];
                ll to;
                if (u[id] == k) to = v[id];
                if (v[id] == k) to = u[id];
                if (cost <= dist[max_id]){
                    dist[to] = max(dist[to], dist[max_id] - cost);
                }
            }
        }
        // debug(dist);
        if (dist[N - 1] < 0) cout << -1 << endl;
        else cout << dist[N - 1] << endl;
    }
}