#1180327 (C++23) No.3653 Space-Time Courier

• 問題: No.3653 Space-Time Courier
• ユーザー: igeee
• 提出日時: 2026-08-29 16:17:52
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: AC
• 実行時間: 622 ms / 4,000 ms
• コード長: 6,847 bytes
• コンパイル時間: 6,481 ms
• コンパイル使用メモリ: 421,580 KB
• 実行使用メモリ: 53,120 KB
• 最終ジャッジ日時: 2026-08-29 16:18:06
• 合計ジャッジ時間: 12,241 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

ファイルパターン	結果
sample	AC * 2
other	AC * 28

ソースコード

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
#define fr first
#define sc second
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;

//負の閉検出、負の辺ありで単一始点最短経路
 
struct Edge{
 ll from;
 ll to;
 ll cost;
};
 
// 負の閉路が存在する場合 true を返し, 負閉路の影響を受ける頂点は -INF にセットされる
// dist は頂点数と同じサイズ, 全要素 INF で初期化しておく
// startからgoalの経路知りたいときは適宜変更
bool BellmanFord(vector<Edge> &edges,vector<ll> &dist,ll start,ll goal = -1){
 dist[start] = 0;
 
 vector<ll> parent(dist.size(),-1);
 
 rep(i,dist.size()){
   bool changed = false;
   for(auto &p:edges){
     if(dist[p.from] == INF){
       continue;
     }
     if(dist[p.from] + p.cost < dist[p.to]){
       dist[p.to] = dist[p.from] + p.cost;
       parent[p.to] = p.from;//直前の頂点を記憶
       changed = true;
     }
   }
 
   //頂点の更新がなくなったら終了
   if(changed == false){
     return false;
   }
 }
 
 //頂点数だけ更に繰り返して負の閉路を受ける点を-INFにしていく
 rep(i,dist.size()){
   for(auto &p:edges){
     if(dist[p.from] == INF){
       continue;
     }
     //まだ更新されるってことは負の閉路の影響をうけて無限に小さくなってしまう
     if(dist[p.from] + p.cost < dist[p.to]){
       dist[p.to] = -INF;
     }
   }
 }
 vector<ll> ret;
 if(goal != -1 && dist[goal] != INF && dist[goal] != -INF){
   for(ll i = goal;i != -1;i = parent[i]){
     ret.push_back(i);
   }
 }
 reverse(all(ret));
 //必要ならretを出力してstartからgoalまでの経路を出力する
 
 
 return true;
}

vvll Johnson(ll n,vector<Edge> &edges){
  //超頂点の追加
  vvll ret(n,vll(n,INF));
  rep(i,n){
    edges.push_back({n,i,0});
  }
  n++;
  vll h(n,INF);
  bool is_loop = BellmanFord(edges,h,n-1);
  if(is_loop){
    return ret;
  }
  n--;//超頂点削除
  rep(i,n)edges.pop_back();
  priority_queue<pll,vpll,greater<pll>> pq;
  vvpll g(n);
  for(auto &[from,to,cost]:edges){
    g[from].push_back({to,cost+h[from]-h[to]});
  }
  rep(i,n){
    ret[i][i] = 0;
    pq.emplace(ret[i][i],i);
    while(!pq.empty()){
      auto [len,now] = pq.top();
      pq.pop();
      if(ret[i][now] < len)continue;
      for(auto&[next,movecost]:g[now]){
        if(ret[i][next] > ret[i][now] + movecost){
          ret[i][next] = ret[i][now] + movecost;
          pq.emplace(ret[i][next],next);
        }
      }
    }
    rep(j,n)ret[i][j]+=-h[i]+h[j];
  }
  return ret;
}
 
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  LL(n,m);
  vll P(n);cin >> P;
  vector<Edge> edges(m);
  rep(i,m){
    LL(u,v,w);
    u--;v--;
    edges[i] ={u,v,w};
  }
  vvll ret = Johnson(n,edges);
  ll ans = INF;
  ll num = 0;
  rep(i,n)rep(j,n)if(i != j){
    ll c = ret[i][j] + P[i] + P[j];
    if(chmin(ans,c))num = 1;
    else if(ans == c)num++;
  }
  cout << ans <<" " << num << endl;
}