結果
問題 | No.17 2つの地点に泊まりたい |
ユーザー | jabee |
提出日時 | 2023-03-02 00:02:40 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 25 ms / 5,000 ms |
コード長 | 4,544 bytes |
コンパイル時間 | 4,433 ms |
コンパイル使用メモリ | 269,804 KB |
実行使用メモリ | 19,124 KB |
最終ジャッジ日時 | 2024-09-16 21:09:42 |
合計ジャッジ時間 | 5,723 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
18,932 KB |
testcase_01 | AC | 23 ms
18,900 KB |
testcase_02 | AC | 23 ms
18,988 KB |
testcase_03 | AC | 24 ms
18,988 KB |
testcase_04 | AC | 23 ms
19,080 KB |
testcase_05 | AC | 23 ms
19,100 KB |
testcase_06 | AC | 23 ms
19,048 KB |
testcase_07 | AC | 25 ms
18,924 KB |
testcase_08 | AC | 25 ms
18,932 KB |
testcase_09 | AC | 25 ms
18,924 KB |
testcase_10 | AC | 24 ms
18,940 KB |
testcase_11 | AC | 24 ms
18,972 KB |
testcase_12 | AC | 24 ms
18,996 KB |
testcase_13 | AC | 24 ms
18,928 KB |
testcase_14 | AC | 24 ms
18,892 KB |
testcase_15 | AC | 24 ms
19,020 KB |
testcase_16 | AC | 24 ms
18,992 KB |
testcase_17 | AC | 23 ms
18,928 KB |
testcase_18 | AC | 23 ms
18,920 KB |
testcase_19 | AC | 23 ms
18,932 KB |
testcase_20 | AC | 23 ms
18,920 KB |
testcase_21 | AC | 22 ms
18,900 KB |
testcase_22 | AC | 22 ms
18,960 KB |
testcase_23 | AC | 25 ms
18,984 KB |
testcase_24 | AC | 23 ms
18,940 KB |
testcase_25 | AC | 23 ms
19,124 KB |
testcase_26 | AC | 25 ms
18,984 KB |
ソースコード
#include<bits/stdc++.h>#include <math.h>#include <algorithm>#include <iostream>#include <vector>#include <atcoder/all>#include <atcoder/dsu>#include <atcoder/segtree>#include <atcoder/lazysegtree>#include <atcoder/modint>#include <atcoder/scc>#include <chrono>#include <random>#ifndef templete#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()//#include<boost/multiprecision/cpp_int.hpp>//using namespace boost::multiprecision;using namespace std;using namespace atcoder;//using atmint = modint998244353;using atmint = modint;using Graph = vector<vector<int>>;using P = pair<long long,long long>;//#pragma GCC optimize ("-O3")using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;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 (b < a) { a = b; return 1; } return 0; }//---------------------------------------------------------------------------------------------------template<int MOD> struct ModInt {static const int Mod = MOD; unsigned x; ModInt() : x(0) { }ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }int get() const { return (int)x; }ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }ModInt operator+(ModInt that) const { return ModInt(*this) += that; }ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }return ModInt(u); }bool operator==(ModInt that) const { return x == that.x; }bool operator!=(ModInt that) const { return x != that.x; }ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }};template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separatorT pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}// combination of paris for n com.aCb(h+w-2,h-1);};//typedef ModInt<1000000007> mint;typedef ModInt<998244353> mint;//typedef ModInt<1000000000> mint;Comb<mint, 2010101> com;//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));//vector dp(n+1,vector<ll>(n+1,0));std::random_device seed_gen;std::mt19937 engine(seed_gen());string ye = "Yes"; string no = "No"; string draw = "Draw";#endif // templete//---------------------------------------------------------------------------------------------------void _main() {ll n;cin >> n;vector<ll>s(n);rep(i,0,n)cin >> s[i];ll m; cin >> m;vector dist(n,vector<ll>(n,infl));rep(i,0,m){ll a,b,c;cin >> a >> b >> c;dist[a][b] = c;dist[b][a] = c;}rep(i,0,n)dist[i][i] = 0;rep(k,0,n)rep(i,0,n)rep(j,0,n)chmin(dist[i][j],dist[i][k] + dist[k][j]);ll ans = infl;rep(i,1,n-1)rep(j,1,n-1){if(i == j)continue;chmin(ans,dist[0][i] + dist[i][j] + dist[j][n-1] + s[i] + s[j]);}cout << ans << endl;}