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

提出ソース

結果

問題	No.1473 おでぶなおばけさん
ユーザー	fuppy_kyopro
提出日時	2021-04-09 21:40:15
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	69 ms / 2,000 ms
コード長	4,918 bytes
コンパイル時間	2,483 ms
コンパイル使用メモリ	220,992 KB
実行使用メモリ	12,188 KB
最終ジャッジ日時	2024-06-25 04:39:53
合計ジャッジ時間	6,454 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 5,888 KB
testcase_01	AC	3 ms 5,760 KB
testcase_02	AC	64 ms 11,548 KB
testcase_03	AC	51 ms 10,396 KB
testcase_04	AC	35 ms 9,108 KB
testcase_05	AC	14 ms 6,872 KB
testcase_06	AC	55 ms 10,264 KB
testcase_07	AC	67 ms 12,056 KB
testcase_08	AC	68 ms 12,188 KB
testcase_09	AC	69 ms 12,056 KB
testcase_10	AC	40 ms 7,484 KB
testcase_11	AC	40 ms 7,448 KB
testcase_12	AC	41 ms 7,576 KB
testcase_13	AC	28 ms 7,576 KB
testcase_14	AC	21 ms 6,740 KB
testcase_15	AC	37 ms 7,496 KB
testcase_16	AC	40 ms 7,448 KB
testcase_17	AC	6 ms 6,016 KB
testcase_18	AC	8 ms 6,144 KB
testcase_19	AC	33 ms 7,572 KB
testcase_20	AC	42 ms 9,880 KB
testcase_21	AC	50 ms 8,496 KB
testcase_22	AC	54 ms 10,776 KB
testcase_23	AC	45 ms 10,520 KB
testcase_24	AC	45 ms 10,008 KB
testcase_25	AC	59 ms 10,388 KB
testcase_26	AC	63 ms 10,520 KB
testcase_27	AC	26 ms 7,448 KB
testcase_28	AC	66 ms 11,928 KB
testcase_29	AC	46 ms 8,476 KB
testcase_30	AC	54 ms 8,984 KB
testcase_31	AC	57 ms 11,804 KB
testcase_32	AC	47 ms 10,268 KB
testcase_33	AC	40 ms 9,500 KB
testcase_34	AC	23 ms 7,832 KB
testcase_35	AC	24 ms 7,448 KB
testcase_36	AC	46 ms 8,732 KB
testcase_37	AC	48 ms 10,140 KB
testcase_38	AC	12 ms 6,488 KB
testcase_39	AC	39 ms 7,444 KB
testcase_40	AC	39 ms 7,452 KB
testcase_41	AC	38 ms 7,448 KB
testcase_42	AC	37 ms 7,496 KB
testcase_43	AC	41 ms 10,008 KB
testcase_44	AC	40 ms 10,008 KB
testcase_45	AC	40 ms 9,880 KB
testcase_46	AC	47 ms 9,756 KB
testcase_47	AC	59 ms 10,392 KB
testcase_48	AC	54 ms 10,264 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ccomplex:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:54,
                 from main.cpp:7:
In member function 'std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]',
    inlined from 'int main()' at main.cpp:183:13:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/ostream:202:25: warning: 'W' may be used uninitialized [-Wmaybe-uninitialized]
  202 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function 'int main()':
main.cpp:162:8: note: 'W' was declared here
  162 |     ll W;
      |        ^

ソースコード

raw source code

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
 
#include <bits/stdc++.h>
 
// #include <atcoder/all>
 
using namespace std;
// using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}
void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}
void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}
void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}
void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}
void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


class UnionFind {
public:
  int n;
  vi par; //�e
  vi ran; //�؂̐[��
  vi num; //�v�f��
  int g; // group��
 
  UnionFind(int _n) {
    n = _n;
    g = n;
    par.resize(n); ran.resize(n); num.resize(n);
    for (int i = 0; i < n; i++) {
      par[i] = i; ran[i] = 0; num[i] = 1;
    }
  }
 
  //�؂̍������߂�
  int find(int x) {
    if (par[x] == x) {
      return x;
    }
    else {
      return par[x] = find(par[x]);
    }
  }
 
  //x��y�̑�����W���𕹍�
  void unite(int x, int y) {
    x = find(x); y = find(y);
    int numsum = num[x] + num[y];
    if (x == y) {
      return;
    }
    if (ran[x]<ran[y]) {
      par[x] = y;
    }
    else {
      par[y] = x;
      if (ran[x] == ran[y]) {
        ran[x]++;
      }
    }
    num[x] = num[y] = numsum;
    g--;
  }
 
  //x��y�������W���ɑ����邩�ۂ�
  bool same(int x, int y) {
    return find(x) == find(y);
  }
 
};


vl bfs(vii& G, int start, int n) {
    vl dist(n, INF);
    dist[start] = 0;
    queue<int> qu;
    qu.push(start);
    while (qu.size()) {
        int u = qu.front();
        qu.pop();
        for (int v: G[u]) {
            ll ncost = dist[u] + 1;
            if (dist[v] > ncost) {
                dist[v] = ncost;
                qu.push(v);
            }
        }
    }
    return dist;
}

const int N = 111111;
vii G(N);

signed main() {
    int n, m;
    cin >> n >> m;
    using P = pair<int, pii>;
    vector<P> ed;
    rep (i, m) {
        int u, v, w;
        cin >> u >> v >> w;
        u--; v--;
        ed.push_back(P(w, pii(u, v)));
    }
    sort(all(ed));
    reverse(all(ed));

    UnionFind uf(n);
    ll W;
    for (P temp: ed) {
        auto [w, uv] = temp;
        auto [u, v] = uv;
        uf.unite(u, v);
        if (uf.same(0, n - 1)) {
            W = w;
            break;
        }
    }

    for (P temp: ed) {
        auto [w, uv] = temp;
        auto [u, v] = uv;
        if (w >= W) {
            G[u].push_back(v);
            G[v].push_back(u);
        }
    }

    vl dist = bfs(G, 0, n);
    cout << W << " " << dist[n - 1] << endl;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード