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

提出ソース

結果

問題	No.1473 おでぶなおばけさん
ユーザー	👑 tute7627
提出日時	2021-04-09 21:32:29
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	72 ms / 2,000 ms
コード長	6,107 bytes
コンパイル時間	2,661 ms
コンパイル使用メモリ	219,004 KB
実行使用メモリ	13,952 KB
最終ジャッジ日時	2024-06-25 04:19:15
合計ジャッジ時間	6,358 ms
ジャッジサーバーID （参考情報）	judge2 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	66 ms 13,184 KB
testcase_03	AC	50 ms 11,008 KB
testcase_04	AC	34 ms 8,832 KB
testcase_05	AC	13 ms 6,940 KB
testcase_06	AC	56 ms 11,008 KB
testcase_07	AC	71 ms 13,824 KB
testcase_08	AC	72 ms 13,952 KB
testcase_09	AC	69 ms 13,952 KB
testcase_10	AC	38 ms 6,940 KB
testcase_11	AC	37 ms 6,944 KB
testcase_12	AC	37 ms 6,940 KB
testcase_13	AC	25 ms 6,944 KB
testcase_14	AC	18 ms 6,940 KB
testcase_15	AC	33 ms 6,940 KB
testcase_16	AC	36 ms 6,944 KB
testcase_17	AC	4 ms 6,944 KB
testcase_18	AC	5 ms 6,944 KB
testcase_19	AC	31 ms 6,940 KB
testcase_20	AC	42 ms 10,112 KB
testcase_21	AC	44 ms 8,448 KB
testcase_22	AC	47 ms 12,288 KB
testcase_23	AC	38 ms 11,136 KB
testcase_24	AC	39 ms 10,880 KB
testcase_25	AC	54 ms 12,160 KB
testcase_26	AC	54 ms 12,288 KB
testcase_27	AC	21 ms 6,940 KB
testcase_28	AC	61 ms 13,568 KB
testcase_29	AC	37 ms 8,320 KB
testcase_30	AC	43 ms 8,960 KB
testcase_31	AC	54 ms 13,696 KB
testcase_32	AC	40 ms 11,136 KB
testcase_33	AC	35 ms 9,856 KB
testcase_34	AC	21 ms 7,040 KB
testcase_35	AC	20 ms 6,940 KB
testcase_36	AC	39 ms 9,600 KB
testcase_37	AC	40 ms 10,752 KB
testcase_38	AC	10 ms 6,944 KB
testcase_39	AC	37 ms 6,940 KB
testcase_40	AC	36 ms 6,940 KB
testcase_41	AC	35 ms 6,940 KB
testcase_42	AC	34 ms 6,944 KB
testcase_43	AC	38 ms 10,172 KB
testcase_44	AC	39 ms 10,300 KB
testcase_45	AC	38 ms 10,300 KB
testcase_46	AC	53 ms 10,624 KB
testcase_47	AC	64 ms 12,160 KB
testcase_48	AC	54 ms 11,264 KB

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

ソースコード

raw source code

//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
  auto tmp = v;
  for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
  rearrange(ord, head);
  rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});
  return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
  vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
  sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});
  return ord;
}
ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;}
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
template< typename T = int >
struct edge {
  int to;
  T cost;
  int id;
  edge() = default;
  edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
  operator int() const { return to; }
};

template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
  Graph<T> ret(n);
  for(int es = 0; es < m; es++){
    int u,v,w=1;
    cin>>u>>v;u-=indexed,v-=indexed;
    if(weighted)cin>>w;
    ret[u].emplace_back(v,w,es);
    if(!directed)ret[v].emplace_back(u,w,es);
  }
  return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
  Graph<T>ret(n);
  for(int i=1;i<n;i++){
    int p;cin>>p;
    p-=indexed;
    ret[p].emplace_back(i);
    if(!directed)ret[i].emplace_back(p);
  }
  return ret;
}
template<typename T>
vector<ll> bfs(Graph<T> &g,int s=0){
  vector<ll>dist(g.size(),INF);
  queue<int>que;
  ll n=g.size();
  que.push(s);
  dist[s]=0;
  while(!que.empty()){
    int x=que.front();
    que.pop();
    for(auto to:g[x]){
      if(dist[to]==INF){
        dist[to]=dist[x]+1;
        que.push(to);
      }
    }
  }
  return dist;
}
struct UnionFind {
  vector<ll> data;
  ll num;
  UnionFind(ll size) : data(size, -1) ,num(size){ }
  bool unite(ll x, ll y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
	  num--;
    }
    return x != y;
  }
  bool find(ll x, ll y) {
    return root(x) == root(y);
  }
  ll root(ll x) {
    return data[x] < 0 ? x : data[x] = root(data[x]);
  }
  ll size(ll x) {
    return -data[root(x)];
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n,m;cin>>n>>m;
  vector<ll>s(m),t(m),d(m);
  rep(i,0,m){
    cin>>s[i]>>t[i]>>d[i];
    s[i]--;t[i]--;
  }
  UnionFind uf(n);
  auto ord=descend(d);
  for(auto i:ord){
    uf.unite(s[i],t[i]);
    if(uf.find(0,n-1)){
      res=d[i];
      break;
    }
  }
  Graph<int>g(n);
  for(auto i:ord){
    if(d[i]>=res){
      g[s[i]].EB(t[i]);
      g[t[i]].EB(s[i]);
    }
  }
  auto dist=bfs(g,0);
  cout<<res spa dist[n-1]<<endl;
  return 0;
}

yukicoder

結果

テストケース

ソースコード