Submission #1585728
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, m; cin >> n >> m;
vector<vector<ll>> dist(n, vector<ll>(n, linf));
rep(i, m) {
ll a, b, c; cin >> a >> b >> c; --a, --b;
dist[a][b] = dist[b][a] = c;
}
rep(i, n) dist[i][i] = 0;
rep(k, n) rep(i, n) rep(j, n) {
chmin(dist[i][j], dist[i][k]+dist[k][j]);
}
ll ans = linf;
rep(i, n) {
ll a = 0;
rep(j, n) chmax(a, dist[i][j]);
chmin(ans, a);
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
D - バスと避けられない運命 |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1796 Byte |
Status |
AC |
Exec Time |
40 ms |
Memory |
1024 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 |
31 ms |
1024 KB |
test_03.txt |
AC |
40 ms |
1024 KB |
test_04.txt |
AC |
12 ms |
640 KB |
test_05.txt |
AC |
14 ms |
640 KB |
test_06.txt |
AC |
2 ms |
384 KB |
test_07.txt |
AC |
30 ms |
896 KB |
test_08.txt |
AC |
1 ms |
256 KB |
test_09.txt |
AC |
10 ms |
512 KB |
test_10.txt |
AC |
2 ms |
384 KB |
test_11.txt |
AC |
2 ms |
384 KB |
test_12.txt |
AC |
17 ms |
768 KB |
test_13.txt |
AC |
2 ms |
384 KB |
test_14.txt |
AC |
3 ms |
384 KB |
test_15.txt |
AC |
28 ms |
768 KB |
test_16.txt |
AC |
3 ms |
384 KB |
test_17.txt |
AC |
11 ms |
512 KB |
test_18.txt |
AC |
15 ms |
640 KB |
test_19.txt |
AC |
4 ms |
384 KB |
test_20.txt |
AC |
3 ms |
384 KB |
test_21.txt |
AC |
1 ms |
256 KB |
test_22.txt |
AC |
6 ms |
512 KB |
test_23.txt |
AC |
1 ms |
256 KB |
test_24.txt |
AC |
31 ms |
1024 KB |
test_25.txt |
AC |
31 ms |
1024 KB |
test_26.txt |
AC |
8 ms |
512 KB |
test_27.txt |
AC |
10 ms |
640 KB |
test_28.txt |
AC |
31 ms |
1024 KB |
test_29.txt |
AC |
31 ms |
1024 KB |
test_30.txt |
AC |
2 ms |
384 KB |
test_31.txt |
AC |
1 ms |
256 KB |
test_32.txt |
AC |
31 ms |
1024 KB |
test_33.txt |
AC |
31 ms |
1024 KB |
test_34.txt |
AC |
1 ms |
256 KB |
test_35.txt |
AC |
6 ms |
512 KB |
test_36.txt |
AC |
31 ms |
1024 KB |