結果
問題 | No.1344 Typical Shortest Path Sum |
ユーザー |
|
提出日時 | 2021-01-16 13:34:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 3,576 bytes |
コンパイル時間 | 2,115 ms |
コンパイル使用メモリ | 202,768 KB |
最終ジャッジ日時 | 2025-01-17 22:08:16 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 77 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int128 = __int128_t;using int64 = long long;using int32 = int;using uint128 = __uint128_t;using uint64 = unsigned long long;using uint32 = unsigned int;#define ALL(obj) (obj).begin(),(obj).end()template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;constexpr int64 MOD = 1'000'000'000LL + 7; //'constexpr int64 MOD2 = 998244353;constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'constexpr long double PI = 3.1415926535897932384626433L;template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr !=obj.begin() ? ", " : "") << *itr; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") <<obj[i]; o << "}"; return o;}template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") <<obj[i]; o << "}"; return o;}template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}void print(void) {cout << endl;}template <class Head> void print(Head&& head) {cout << head;print();}template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}template <class T> void chmax(T& a, const T b){a=max(a,b);}template <class T> void chmin(T& a, const T b){a=min(a,b);}vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer,delemiter) ) res.push_back(buffer); return res;}inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}/*** @url* @est*/int main() {cin.tie(0);ios::sync_with_stdio(false);int N,M; cin >> N >> M;vector<int> s(M),t(M);vector<int64> d(M),c(N);for(int i=0;i<M;++i) cin >> s[i] >> t[i] >> d[i];for(int i=0;i<M;++i) s[i]--,t[i]--;constexpr int64 inf = 1e17;int64 ans = 0;for(int i=0;i<N;++i) {for(int j=0;j<N;++j) c[j]=inf;c[i]=0;for(int j = 0; j < N; ++j){for(int k = 0; k < M; ++k){if(c[s[k]]!=inf) chmin(c[t[k]],c[s[k]]+d[k]);}}for(int j=0;j<N;++j) if(c[j]==inf || i==j) c[j]=0;cout << accumulate(ALL(c),0LL) << "\n";}return 0;}