Submission #7075789
Source Code Expand
#include <bits/stdc++.h>
#define range(i, l, r) for(int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
os << "(";
os << p.first << ", " << p.second;
return os << ")";
}
template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
os << "[";
if (v.size() == 0) return os << "]";
for (int i = 0; i < v.size() - 1; i++) {
os << v.at(i) << ", ";
}
return os << v.at(v.size() - 1) << "]";
}
template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
os << "{";
if (s.begin() == s.end()) return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
os << "{";
if (m.begin() == m.end()) return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
lint pow(lint num, lint e, lint MOD) {
lint res = 1;
lint cur_num = num;
while (e) {
if (e & 1) {
res *= cur_num;
res %= MOD;
}
cur_num *= cur_num;
cur_num %= MOD;
e >>= 1;
}
return res;
}
auto warshall_floyd(const vec<vec<plint>>& adj) {
lint num_nodes = adj.size();
vec<vec<lint>> d(num_nodes, vec<lint>(num_nodes, 1LL << 58));
range(i, 0, num_nodes) {
d.at(i).at(i) = 0;
for (const auto& p : adj.at(i)) {
lint j, w;
tie(j, w) = p;
d.at(i).at(j) = min(d.at(i).at(j), w);
d.at(j).at(i) = min(d.at(j).at(i), w);
}
}
range(k, 0, num_nodes) range(i, 0, num_nodes) range(j, 0, num_nodes) {
d.at(i).at(j) = min(d.at(i).at(j), d.at(i).at(k) + d.at(k).at(j));
}
return d;
}
int main() {
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
lint N, M;
cin >> N >> M;
vec<vec<plint>> adj(N, vec<plint>());
range(i, 0, M) {
lint a, b, t;
cin >> a >> b >> t;
a--; b--;
adj.at(a).emplace_back(b, t);
adj.at(b).emplace_back(a, t);
}
vec<vec<lint>> d = warshall_floyd(adj);
lint min_max = 1LL << 58;
range(i, 0, N) {
lint max_time = 0;
range(j, 0, N) max_time = max(max_time, d.at(i).at(j));
min_max = min(min_max, max_time);
}
cout << min_max << "\n";
}
Submission Info
Submission Time |
|
Task |
D - バスと避けられない運命 |
User |
tmsausa |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
3826 Byte |
Status |
AC |
Exec Time |
76 ms |
Memory |
3456 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
test_01.txt |
AC |
1 ms |
256 KB |
test_02.txt |
AC |
65 ms |
1024 KB |
test_03.txt |
AC |
76 ms |
3456 KB |
test_04.txt |
AC |
23 ms |
768 KB |
test_05.txt |
AC |
24 ms |
1408 KB |
test_06.txt |
AC |
4 ms |
512 KB |
test_07.txt |
AC |
57 ms |
3072 KB |
test_08.txt |
AC |
1 ms |
256 KB |
test_09.txt |
AC |
17 ms |
1280 KB |
test_10.txt |
AC |
3 ms |
512 KB |
test_11.txt |
AC |
4 ms |
512 KB |
test_12.txt |
AC |
34 ms |
1024 KB |
test_13.txt |
AC |
4 ms |
512 KB |
test_14.txt |
AC |
5 ms |
512 KB |
test_15.txt |
AC |
52 ms |
2944 KB |
test_16.txt |
AC |
6 ms |
640 KB |
test_17.txt |
AC |
20 ms |
1280 KB |
test_18.txt |
AC |
31 ms |
896 KB |
test_19.txt |
AC |
6 ms |
640 KB |
test_20.txt |
AC |
5 ms |
512 KB |
test_21.txt |
AC |
1 ms |
256 KB |
test_22.txt |
AC |
12 ms |
640 KB |
test_23.txt |
AC |
1 ms |
256 KB |
test_24.txt |
AC |
65 ms |
1024 KB |
test_25.txt |
AC |
65 ms |
1024 KB |
test_26.txt |
AC |
15 ms |
512 KB |
test_27.txt |
AC |
20 ms |
640 KB |
test_28.txt |
AC |
65 ms |
1024 KB |
test_29.txt |
AC |
65 ms |
1024 KB |
test_30.txt |
AC |
4 ms |
384 KB |
test_31.txt |
AC |
1 ms |
256 KB |
test_32.txt |
AC |
65 ms |
1024 KB |
test_33.txt |
AC |
65 ms |
1024 KB |
test_34.txt |
AC |
2 ms |
256 KB |
test_35.txt |
AC |
12 ms |
512 KB |
test_36.txt |
AC |
65 ms |
1024 KB |