結果

問題 No.1473 おでぶなおばけさん
ユーザー hamrayhamray
提出日時 2021-06-18 14:10:29
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,984 bytes
コンパイル時間 2,079 ms
コンパイル使用メモリ 179,416 KB
実行使用メモリ 11,540 KB
最終ジャッジ日時 2024-06-22 06:30:23
合計ジャッジ時間 9,715 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
5,504 KB
testcase_01 AC 4 ms
5,632 KB
testcase_02 AC 232 ms
10,496 KB
testcase_03 WA -
testcase_04 AC 59 ms
7,852 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 91 ms
10,012 KB
testcase_08 WA -
testcase_09 AC 84 ms
9,984 KB
testcase_10 AC 36 ms
7,844 KB
testcase_11 WA -
testcase_12 AC 37 ms
8,192 KB
testcase_13 AC 24 ms
7,168 KB
testcase_14 AC 18 ms
6,944 KB
testcase_15 AC 33 ms
7,936 KB
testcase_16 AC 33 ms
7,552 KB
testcase_17 AC 6 ms
6,944 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 162 ms
10,840 KB
testcase_22 AC 183 ms
10,528 KB
testcase_23 AC 169 ms
9,344 KB
testcase_24 AC 163 ms
10,056 KB
testcase_25 AC 280 ms
11,444 KB
testcase_26 AC 282 ms
11,540 KB
testcase_27 AC 37 ms
7,424 KB
testcase_28 AC 95 ms
9,984 KB
testcase_29 AC 84 ms
9,272 KB
testcase_30 AC 121 ms
10,260 KB
testcase_31 AC 361 ms
10,624 KB
testcase_32 WA -
testcase_33 AC 165 ms
9,996 KB
testcase_34 AC 66 ms
7,808 KB
testcase_35 AC 65 ms
8,556 KB
testcase_36 AC 96 ms
9,236 KB
testcase_37 AC 147 ms
9,088 KB
testcase_38 AC 19 ms
6,940 KB
testcase_39 AC 35 ms
7,552 KB
testcase_40 AC 34 ms
7,552 KB
testcase_41 AC 32 ms
7,348 KB
testcase_42 AC 32 ms
7,352 KB
testcase_43 AC 50 ms
9,564 KB
testcase_44 AC 50 ms
9,436 KB
testcase_45 AC 49 ms
9,564 KB
testcase_46 AC 48 ms
8,704 KB
testcase_47 AC 55 ms
9,216 KB
testcase_48 AC 49 ms
8,832 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:185:9: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  185 |     auto[p, v] = pq.top();
      |         ^
main.cpp:189:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  189 |     for(auto[u, d]: g[v]) {
      |             ^

ソースコード

diff # 

#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;
}

int n, m;
vector<vector<pair<int, int>>> g(101010);
pair<int, int> dist[101010];
int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(8);
  
  cin >> n >> m;
  REP(i,m) {
    int s, t, d; cin >> s >> t >> d;
    s--; t--;
    g[s].push_back({t, d});
    g[t].push_back({s, d});
  }
  REP(i,n) dist[i] = make_pair(-1, 1e9);
  dist[0] = {1e9+1, 0};
  priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
  pq.push({-(1e9+1),0});
  while(pq.size()) {
    auto[p, v] = pq.top();
    pq.pop();
    p *= -1;
    if(dist[v].first < p) continue;
    for(auto[u, d]: g[v]) {
      int c = min(p, d);
      if(dist[u].first < c) {
        dist[u] = {c, dist[v].second+1};
        pq.push({-c, u});
      }else if(dist[u].first == c && dist[u].second > dist[v].second + 1) {
        dist[u] = {c, dist[v].second+1};
        pq.push({-c, u});
      }
    }
  }
  cout << dist[n-1].first << " " << dist[n-1].second << endl;

  return 0;
}
0