#667372 (C++14) No.1473 おでぶなおばけさん

• 問題: No.1473 おでぶなおばけさん
• ユーザー: hamray
• 提出日時: 2021-06-18 14:34:34
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 67 ms / 2,000 ms
• コード長: 5,518 bytes
• コンパイル時間: 2,139 ms
• コンパイル使用メモリ: 190,520 KB
• 実行使用メモリ: 11,136 KB
• 最終ジャッジ日時: 2024-06-22 07:16:49
• 合計ジャッジ時間: 6,490 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	59 ms; 10,464 KB
testcase_03	AC	48 ms; 8,960 KB
testcase_04	AC	34 ms; 7,424 KB
testcase_05	AC	13 ms; 6,940 KB
testcase_06	AC	52 ms; 8,832 KB
testcase_07	AC	65 ms; 11,136 KB
testcase_08	AC	67 ms; 11,136 KB
testcase_09	AC	65 ms; 11,136 KB
testcase_10	AC	39 ms; 6,944 KB
testcase_11	AC	39 ms; 6,940 KB
testcase_12	AC	38 ms; 6,944 KB
testcase_13	AC	25 ms; 6,940 KB
testcase_14	AC	18 ms; 6,940 KB
testcase_15	AC	34 ms; 6,940 KB
testcase_16	AC	38 ms; 6,940 KB
testcase_17	AC	4 ms; 6,944 KB
testcase_18	AC	6 ms; 6,940 KB
testcase_19	AC	32 ms; 6,940 KB
testcase_20	AC	41 ms; 8,320 KB
testcase_21	AC	47 ms; 6,940 KB
testcase_22	AC	54 ms; 9,216 KB
testcase_23	AC	44 ms; 9,088 KB
testcase_24	AC	46 ms; 8,320 KB
testcase_25	AC	60 ms; 8,960 KB
testcase_26	AC	64 ms; 8,832 KB
testcase_27	AC	25 ms; 6,944 KB
testcase_28	AC	64 ms; 10,880 KB
testcase_29	AC	43 ms; 6,944 KB
testcase_30	AC	48 ms; 7,168 KB
testcase_31	AC	52 ms; 10,752 KB
testcase_32	AC	42 ms; 8,960 KB
testcase_33	AC	38 ms; 7,936 KB
testcase_34	AC	22 ms; 6,944 KB
testcase_35	AC	22 ms; 6,940 KB
testcase_36	AC	46 ms; 6,940 KB
testcase_37	AC	46 ms; 8,576 KB
testcase_38	AC	11 ms; 6,944 KB
testcase_39	AC	37 ms; 6,944 KB
testcase_40	AC	37 ms; 6,944 KB
testcase_41	AC	34 ms; 6,940 KB
testcase_42	AC	35 ms; 6,940 KB
testcase_43	AC	40 ms; 8,192 KB
testcase_44	AC	39 ms; 8,192 KB
testcase_45	AC	39 ms; 8,192 KB
testcase_46	AC	45 ms; 7,936 KB
testcase_47	AC	55 ms; 8,960 KB
testcase_48	AC	49 ms; 8,832 KB

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:221:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  221 |     auto[u,v] = g[i].second;
      |         ^

ソースコード

#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
 
using namespace std;
 
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
 
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
 
 
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
const double EPS = 1e-12, PI = acos(-1);
const double pi = 3.141592653589793238462643383279;
//ここから編集    
typedef string::const_iterator State;
ll GCD(ll a, ll b){
  return (b==0)?a:GCD(b, a%b);
}
ll LCM(ll a, ll b){
  return a/GCD(a, b) * b;
}
template< int mod >
struct ModInt {
  int x;
 
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
 
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
 
  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }
 
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
 
  ModInt operator-() const { return ModInt(-x); }
 
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
 
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
 
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
 
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
 
  bool operator==(const ModInt &p) const { return x == p.x; }
 
  bool operator!=(const ModInt &p) const { return x != p.x; }
 
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
 
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
 
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
 
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }
 
  static int get_mod() { return mod; }
};
 
using modint = ModInt< 1000000007 >;
using modint9 = ModInt<998244353>;
template< typename T >
struct Combination {
  vector< T > _fact, _rfact, _inv;
 
  Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
    _fact[0] = _rfact[sz] = _inv[0] = 1;
    for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;
    _rfact[sz] /= _fact[sz];
    for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);
    for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];
  }
 
  inline T fact(int k) const { return _fact[k]; }
 
  inline T rfact(int k) const { return _rfact[k]; }
 
  inline T inv(int k) const { return _inv[k]; }
 
  T P(int n, int r) const {
    if(r < 0 || n < r) return 0;
    return fact(n) * rfact(n - r);
  }
 
  T C(int p, int q) const {
    if(q < 0 || p < q) return 0;
    return fact(p) * rfact(q) * rfact(p - q);
  }
 
  T H(int n, int r) const {
    if(n < 0 || r < 0) return (0);
    return r == 0 ? 1 : C(n + r - 1, r);
  }
};

ll modpow(ll x, ll n, ll mod = 100000007) {
  ll res = 1;
  while(n) {
    if(n&1) res = (res * x)%mod;
    x = (x*x)%mod;
    n >>= 1;
  }
  return res;
}
struct UnionFind{
  vector<int> par;
  vector<int> siz;

  UnionFind(int sz_): par(sz_), siz(sz_) {
    for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;
  }

  void init(int sz_){
    par.resize(sz_);
    siz.resize(sz_);
    for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;
  }

  int root(int x){
    if(x == par[x]) return x;
    return par[x] = root(par[x]);
  }

  bool merge(int x, int y){
    x = root(x), y = root(y);
    if(x == y) return false;
    if(siz[x] < siz[y]) swap(x, y);
    siz[x] += siz[y];
    par[y] = x;
    return true;
  }

  bool issame(int x, int y){
    return root(x) == root(y);
  }

  int size(int x){
    return siz[root(x)];
  }
};
int n, m;

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(8);
  
  cin >> n >> m;
  vector<pair<int, pair<int, int>>> g(m);
  REP(i,m) {
    int s, t, d; cin >> s >> t >> d;
    s--; t--;
    g[i] = {d, {s,t}};
  }
  UnionFind uf(n);
  sort(all(g));
  reverse(all(g));
  int mx = -1;
  vector<vector<int>> g2(n);
  REP(i,m) {
    if(mx != g[i].first && uf.issame(0,n-1)) break;
    auto[u,v] = g[i].second;
    
    uf.merge(u, v);
    mx = g[i].first;
    g2[u].push_back(v);
    g2[v].push_back(u);
    
  }
  vector<int> dist(n, 1e9);
  dist[0] = 0;
  queue<int> q; q.push(0);
  while(q.size()) {
    int v = q.front();
    q.pop();
    for(auto u: g2[v]) {
      if(dist[u] > dist[v] + 1) {
        dist[u] = dist[v] + 1;
        q.push(u);
      }
    }
  }
  cout << mx << " " << dist[n-1] << endl;
  return 0;
}