結果
問題 | No.1344 Typical Shortest Path Sum |
ユーザー |
|
提出日時 | 2021-01-16 14:27:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 4,115 bytes |
コンパイル時間 | 2,008 ms |
コンパイル使用メモリ | 198,740 KB |
最終ジャッジ日時 | 2025-01-17 22:50:05 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 77 |
ソースコード
//@formatter:off#include<bits/stdc++.h>#define overload4(_1,_2,_3,_4,name,...) name#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define pb push_back#define eb emplace_back#define vi vector<int>#define vvi vector<vector<int>>#define vl vector<ll>#define vvl vector<vector<ll>>#define vd vector<double>#define vvd vector<vector<double>>#define vs vector<string>#define vc vector<char>#define vvc vector<vector<char>>#define vb vector<bool>#define vvb vector<vector<bool>>#define vp vector<P>#define vvp vector<vector<P>>#ifdef __LOCAL#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }#else#define debug(...) void(0)#endif#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)using namespace std;using ll = long long;using P = pair<int,int>;using LP = pair<ll,ll>;template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']';}void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }template<class T> void fin(T a) { cout << a << '\n'; exit(0); }template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}void scan(){}template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }template<class T> void print(const T& t){ cout << t << '\n'; }template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }const int inf = 1001001001;const ll linf = 1001001001001001001;//@formatter:onstruct edge {int a, b; // from a to bll len;edge(int a, int b, ll l) : a(a), b(b), len(l) {}};// return value is {} if there is a negative cycle./* detect only if a certain node(goal) is reachablefrom a negative cycle (if goal != -1) */// detect any negative cycles (if goal == -1)vector<ll> bellman_ford(int n, const vector<edge> &v, int start, int goal = -1) {vector<ll> dist(n, linf);dist[start] = 0;if (goal == -1) {rep(i, n) {for (auto e : v) {if (dist[e.a] < linf && chmin(dist[e.b], dist[e.a] + e.len)) {if (i == n - 1) return {};}}}} else {rep(i, n * 2) {for (auto e : v) {if (dist[e.a] < linf && chmin(dist[e.b], dist[e.a] + e.len)) {if (i >= n - 1 && e.b == goal) return {};else if (i >= n - 1) dist[e.b] = -linf;}}}}return dist;}using vve = vector<vector<edge>>;int main() {ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);INT(n, m);vector<edge> es;rep(_, m) {INT(s, t);LL(d);s--;t--;es.eb(s, t, d);}rep(i, n) {vl dist = bellman_ford(n, es, i);ll ans = 0;rep(j, n) {if (dist[j] == linf) continue;ans += dist[j];}print(ans);}}