結果

問題 No.2916 累進コスト最小化
ユーザー ecottea
提出日時 2024-10-05 02:00:45
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 3,013 ms / 3,500 ms
コード長 10,491 bytes
コンパイル時間 24,113 ms
コンパイル使用メモリ 358,224 KB
最終ジャッジ日時 2025-02-24 15:51:10
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

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

// QCFium
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9e18int -2^31 2^31 = 2e9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // mod
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = static_modint<100>;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
template <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(...)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE MLE
#endif
//
/*
* to :
* cost :
*/
struct WEdge {
// verify : https://judge.yosupo.jp/problem/shortest_path
int from = -1;
int to = -1; //
int r = -1;
int w = -1;
WEdge() {}
WEdge(int from, int to, int r, int w) : from(from), to(to), r(r), w(w) {}
//
operator int() const { return to; }
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const WEdge& e) {
os << '(' << e.to << ',' << e.r << "," << e.w << ')';
return os;
}
#endif
};
//
/*
* WGraph g
* g[v] : v
*
* verify : https://judge.yosupo.jp/problem/shortest_path
*/
using WGraph = vector<vector<WEdge>>;
//O(n + m)
/*
* (, , ) n m
*
* n :
* m : n-1
* directed : false
* zero_indexed : 0-indexed false
*/
WGraph read_WGraph(int n, int m = -1, bool directed = false, bool zero_indexed = false) {
// verify : https://judge.yosupo.jp/problem/shortest_path
WGraph g(n);
if (m == -1) m = n - 1;
rep(j, m) {
int u, v; int r, w;
cin >> u >> v >> r >> w;
if (!zero_indexed) { --u; --v; }
g[u].push_back({ u, v, r, w });
if (!directed && u != v) g[v].push_back({ v, u, r, w });
}
return g;
}
//O(n + m log n)
/*
* g st INFL
* ini_cost x e f(e, x)
*
*
* f(x) x 調
* f(x) ≧ x
*/
template <class G, class FUNC, class T>
vector<WEdge> dijkstra(const G& g, int st, int gl, const FUNC& f, T ini_cost) {
// : https://miscalc.hatenablog.com/entry/2022/10/10/115348
// verify : https://atcoder.jp/contests/abc342/tasks/abc342_e
int n = sz(g);
vector<T> cost(n, T(INFL)); // st
cost[st] = ini_cost;
vector<WEdge> pe(n);
// (st , )
priority_queue_rev<pair<T, int>> q;
q.push({ ini_cost, st });
while (!q.empty()) {
auto [c, s] = q.top(); q.pop();
// 辿
if (s == gl) break;
// O(n^2)
if (cost[s] < c) continue;
// 辿
repe(e, g[s]) {
T nc = f(e, c);
if (chmin(cost[e.to], nc)) {
pe[e.to] = e;
q.push({ nc, e.to });
}
}
}
// st gl
if (cost[gl] == T(INFL)) return vector<WEdge>();
vector<WEdge> es;
int t = gl;
while (t != st) {
es.push_back(pe[t]);
t = pe[t].from;
}
reverse(all(es));
return es;
/* f
auto f = [&](const WEdge& e, ll cost) {
return cost + e.cost;
};
*/
}
// C
void WA() {
int n, m; int C;
cin >> n >> m >> C;
auto g = read_WGraph(n, m);
auto f = [&](const WEdge& e, ll cost) {
cost *= -1;
cost -= cost / e.r + e.w;
chmax(cost, -1LL);
cost *= -1;
return cost;
};
auto es = dijkstra(g, 0, n - 1, f, -(ll)C);
dump(es);
if (es.empty()) {
rep(hoge, C) cout << -1 << "\n";
return;
}
repi(c0, 1, C) {
int c = c0;
repe(e, es) {
c -= c / e.r + e.w;
if (c < 0) {
c = -1;
break;
}
}
cout << c << "\n";
}
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
auto start = chrono::system_clock::now();
int n, m; int C;
cin >> n >> m >> C;
auto g = read_WGraph(n, m);
vi res(C + 1, -1);
auto f = [&](const WEdge& e, double cost) {
cost *= -1;
cost -= cost / e.r + e.w;
chmax(cost, -1.);
cost *= -1;
return cost;
};
mt19937_64 mt((int)time(NULL));
uniform_real_distribution<double> rnd(1, C);
while (1) {
auto es = dijkstra(g, 0, n - 1, f, -rnd(mt));
dump(es);
if (!es.empty()) {
repi(c0, 1, C) {
int c = c0;
repe(e, es) {
c -= c / e.r + e.w;
if (c < 0) {
c = -1;
break;
}
}
chmax(res[c0], c);
}
}
auto now = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(now - start).count();
if (msec >= 3000) break;
}
repi(c0, 1, C) {
cout << res[c0] << "\n";
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0