結果
問題 | No.1316 Maximum Minimum Spanning Tree |
ユーザー | satashun |
提出日時 | 2020-12-13 22:08:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,896 bytes |
コンパイル時間 | 1,861 ms |
コンパイル使用メモリ | 198,572 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-09-20 00:07:59 |
合計ジャッジ時間 | 3,820 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | WA | - |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | WA | - |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | WA | - |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | WA | - |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | WA | - |
testcase_18 | AC | 2 ms
6,944 KB |
testcase_19 | WA | - |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | WA | - |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | WA | - |
testcase_24 | AC | 1 ms
6,944 KB |
testcase_25 | WA | - |
testcase_26 | AC | 2 ms
6,940 KB |
testcase_27 | WA | - |
testcase_28 | AC | 1 ms
6,940 KB |
testcase_29 | WA | - |
testcase_30 | AC | 2 ms
6,940 KB |
testcase_31 | WA | - |
testcase_32 | AC | 1 ms
6,940 KB |
testcase_33 | WA | - |
testcase_34 | AC | 1 ms
6,940 KB |
testcase_35 | WA | - |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | WA | - |
testcase_38 | AC | 2 ms
6,940 KB |
testcase_39 | WA | - |
testcase_40 | AC | 2 ms
6,944 KB |
testcase_41 | WA | - |
testcase_42 | AC | 2 ms
6,940 KB |
testcase_43 | WA | - |
testcase_44 | AC | 1 ms
6,940 KB |
testcase_45 | WA | - |
testcase_46 | AC | 1 ms
6,940 KB |
testcase_47 | WA | - |
testcase_48 | AC | 1 ms
6,940 KB |
testcase_49 | WA | - |
testcase_50 | AC | 2 ms
6,944 KB |
testcase_51 | WA | - |
testcase_52 | AC | 2 ms
6,940 KB |
testcase_53 | WA | - |
testcase_54 | AC | 1 ms
6,940 KB |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; } template <class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; } template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif int main() { cout << -1 << endl; /* int N, M, K; cin >> N >> M >> K; V<pair<pii, pii>> es; ll sum_d = 0; rep(i, M) { int a, b, c, d; cin >> a >> b >> c >> d; --a, --b; es.eb(mp(a, b), mp(c, d)); sum_d += d; } if (ll(N - 1) * M * K > sum_d) { cout << -1 << endl; }*/ return 0; }