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

• 問題: No.1473 おでぶなおばけさん
• ユーザー: t98slider
• 提出日時: 2021-04-09 21:52:18
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 82 ms / 2,000 ms
• コード長: 5,846 bytes
• コンパイル時間: 2,330 ms
• コンパイル使用メモリ: 186,104 KB
• 実行使用メモリ: 10,544 KB
• 最終ジャッジ日時: 2023-09-07 10:58:26
• 合計ジャッジ時間: 7,016 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,384 KB
testcase_01	AC	2 ms; 4,380 KB
testcase_02	AC	77 ms; 10,008 KB
testcase_03	AC	55 ms; 8,704 KB
testcase_04	AC	39 ms; 6,984 KB
testcase_05	AC	14 ms; 4,380 KB
testcase_06	AC	61 ms; 8,304 KB
testcase_07	AC	79 ms; 10,380 KB
testcase_08	AC	82 ms; 10,436 KB
testcase_09	AC	79 ms; 10,372 KB
testcase_10	AC	41 ms; 4,456 KB
testcase_11	AC	42 ms; 4,612 KB
testcase_12	AC	43 ms; 4,436 KB
testcase_13	AC	27 ms; 4,380 KB
testcase_14	AC	20 ms; 4,380 KB
testcase_15	AC	37 ms; 4,380 KB
testcase_16	AC	41 ms; 4,380 KB
testcase_17	AC	4 ms; 4,380 KB
testcase_18	AC	6 ms; 4,376 KB
testcase_19	AC	35 ms; 4,964 KB
testcase_20	AC	48 ms; 7,724 KB
testcase_21	AC	51 ms; 5,928 KB
testcase_22	AC	65 ms; 8,916 KB
testcase_23	AC	53 ms; 8,876 KB
testcase_24	AC	55 ms; 8,120 KB
testcase_25	AC	67 ms; 8,656 KB
testcase_26	AC	74 ms; 8,368 KB
testcase_27	AC	27 ms; 4,608 KB
testcase_28	AC	80 ms; 10,544 KB
testcase_29	AC	49 ms; 6,304 KB
testcase_30	AC	57 ms; 6,928 KB
testcase_31	AC	67 ms; 10,120 KB
testcase_32	AC	51 ms; 8,284 KB
testcase_33	AC	43 ms; 7,612 KB
testcase_34	AC	24 ms; 5,400 KB
testcase_35	AC	24 ms; 4,868 KB
testcase_36	AC	52 ms; 6,192 KB
testcase_37	AC	54 ms; 8,072 KB
testcase_38	AC	12 ms; 4,380 KB
testcase_39	AC	41 ms; 4,384 KB
testcase_40	AC	41 ms; 4,380 KB
testcase_41	AC	39 ms; 4,380 KB
testcase_42	AC	38 ms; 4,380 KB
testcase_43	AC	44 ms; 8,036 KB
testcase_44	AC	44 ms; 7,816 KB
testcase_45	AC	44 ms; 7,788 KB
testcase_46	AC	54 ms; 7,524 KB
testcase_47	AC	66 ms; 8,600 KB
testcase_48	AC	60 ms; 8,448 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=(ll)1<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

struct dsu {
  public:
    dsu() : _n(0) {}
    dsu(int n) : _n(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int _n;
    std::vector<int> parent_or_size;
};

int main(){
    INT(n,m);
    dsu uf(n);
    vector<vector<int>> graph(n);
    vector<tuple<int,int,int>> edge(m);
    rep(i,m){
        in(get<1>(edge[i]),get<2>(edge[i]),get<0>(edge[i]));
    }
    sort(rall(edge));
    int ans=-1;
    rep(i,m){
        if(get<0>(edge[i])<ans)break;
        graph[--get<2>(edge[i])].push_back(--get<1>(edge[i]));
        graph[get<1>(edge[i])].push_back(get<2>(edge[i]));
        uf.merge(get<2>(edge[i]),get<1>(edge[i]));
        if(uf.same(0,n-1)){
            ans=get<0>(edge[i]);
        }
    }
    queue<int> next;
    next.push(0);
    vector<int> dist(n,INF);
    dist[0]=0;
    while(!next.empty()){
        rep(j,graph[next.front()].size()){
            if(dist[next.front()]+1<dist[graph[next.front()][j]]){
                dist[graph[next.front()][j]]=dist[next.front()]+1;
                next.push(graph[next.front()][j]);
            }
        }
        next.pop();
    }
    out(ans,dist[n-1]);
}