#include using namespace std; #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP1(i, n) for (auto i = std::decay_t{}; (i) != (n); ++(i)) #define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i)) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define REP(i, l, r) rep(i, l, r+1) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() using ll = long long; using ld = long double; using P = pair; struct Edge { int to; ll w; }; //using Graph = vector >; using Graph = vector >; const ll INF = 2e18; //const int INF = 2e9; template using vc = vector; template using vv = vector >; template using vvv = vector > >; template using pq = priority_queue; template using pq_g = priority_queue, greater >; template istream& operator>>(istream& i, vc& v) { rep(j, 0, v.size()) i>>v[j]; return i; } template ostream& operator<<(ostream& o, vc& v) { rep(j, 0, v.size()) o< bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; } template bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; } ll dajk(const Graph& G, int N, ll w) { vc dist(N, -1); dist[0] = 0; queue que; que.push(0); while(!que.empty()) { int v = que.front(); que.pop(); for(Edge e : G[v]) { if(dist[e.to] != -1) continue; if(w > e.w) continue; dist[e.to] = dist[v] + 1; que.push(e.to); } } return dist[N-1]; } int main() { // 高速化 ios::sync_with_stdio(false); cin.tie(nullptr); // 小数点の出力桁数を指定 cout << fixed << setprecision(10); // メイン int N, M; cin >> N >> M; Graph G(N); rep(i, 0, M) { int a, b; ll d; cin >> a >> b >> d; a--, b--; G[a].push_back({b, d}); G[b].push_back({a, d}); } ll left = 0, right = INF; while(right - left > 1) { ll mid = (left+right)/2; ll res = dajk(G, N, mid); if(res == -1) right = mid; else left = mid; } cout << left << " " << dajk(G, N, left) << endl; return 0; }