結果

問題 No.1344 Typical Shortest Path Sum
ユーザー ningenMeningenMe
提出日時 2021-01-16 13:24:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,559 bytes
コンパイル時間 2,255 ms
コンパイル使用メモリ 210,288 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-27 13:49:26
合計ジャッジ時間 3,623 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,820 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 1 ms
6,816 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 1 ms
6,820 KB
testcase_09 WA -
testcase_10 AC 1 ms
6,816 KB
testcase_11 AC 1 ms
6,820 KB
testcase_12 AC 1 ms
6,820 KB
testcase_13 AC 1 ms
6,816 KB
testcase_14 WA -
testcase_15 AC 1 ms
6,816 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 2 ms
6,816 KB
testcase_20 AC 2 ms
6,816 KB
testcase_21 WA -
testcase_22 AC 2 ms
6,816 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 1 ms
6,820 KB
testcase_26 WA -
testcase_27 AC 2 ms
6,816 KB
testcase_28 WA -
testcase_29 AC 2 ms
6,820 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 1 ms
6,820 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 1 ms
6,820 KB
testcase_36 AC 2 ms
6,820 KB
testcase_37 WA -
testcase_38 AC 1 ms
6,816 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 AC 2 ms
6,820 KB
testcase_61 AC 2 ms
6,820 KB
testcase_62 AC 5 ms
6,820 KB
testcase_63 AC 2 ms
6,816 KB
testcase_64 AC 2 ms
6,816 KB
testcase_65 AC 6 ms
6,816 KB
testcase_66 AC 5 ms
6,820 KB
testcase_67 AC 5 ms
6,816 KB
testcase_68 AC 2 ms
6,816 KB
testcase_69 AC 2 ms
6,816 KB
testcase_70 WA -
testcase_71 WA -
testcase_72 AC 2 ms
6,820 KB
testcase_73 AC 1 ms
6,816 KB
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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){
                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;
}
0