#ifdef NACHIA // #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include #include #include #include #include #include #include #include #include using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(i64 i=0; i<(i64)(n); i++) #define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--) const i64 INF = 1001001001001001001; const char* yn(bool x){ return x ? "Yes" : "No"; } template void chmin(A& l, const A& r){ if(r < l) l = r; } template void chmax(A& l, const A& r){ if(l < r) l = r; } template using nega_queue = std::priority_queue,std::greater>; using Modint = atcoder::static_modint<998244353>; #include #include template struct vec; template struct seq_view{ using Ref = typename std::iterator_traits::reference; using Elem = typename std::iterator_traits::value_type; Iter a, b; Iter begin() const { return a; } Iter end() const { return b; } int size() const { return (int)(b-a); } seq_view(Iter first, Iter last) : a(first), b(last) {} seq_view sort() const { std::sort(a, b); return *this; } Ref& operator[](int x){ return *(a+x); } template, class ret = vec> ret sorti(F f = F()) const { ret x(size()); for(int i=0; i> ret col() const { return ret(begin(), end()); } template, class ret = vec>> ret rle(F eq = F()) const { auto x = ret(); for(auto& a : (*this)){ if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++; } return x; } template seq_view sort(F f) const { std::sort(a, b, f); return *this; } Iter uni() const { return std::unique(a, b); } Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); } Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); } int lbi(const Elem& x) const { return lb(x) - a; } int ubi(const Elem& x) const { return ub(x) - a; } seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; } template Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); } template Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); } template Iter when_true_to_false(F f) const { if(a == b) return a; return std::lower_bound(a, b, *a, [&](const Elem& x, const Elem&){ return f(x); }); } seq_view same(Elem x) const { return { lb(x), ub(x) }; } template auto map(F f) const { vec r; for(auto& x : *this) r.emp(f(x)); return r; } Iter max() const { return std::max_element(a, b); } Iter min() const { return std::min_element(a, b); } template> Iter min(F f) const { return std::min_element(a, b, f); } seq_view rev() const { std::reverse(a, b); return *this; } }; template struct vec { using Base = typename std::vector; using Iter = typename Base::iterator; using CIter = typename Base::const_iterator; using View = seq_view; using CView = seq_view; vec(){} explicit vec(int n, const Elem& value = Elem()) : a(0 vec(I2 first, I2 last) : a(first, last) {} vec(std::initializer_list il) : a(std::move(il)) {} vec(Base b) : a(std::move(b)) {} operator Base() const { return a; } Iter begin(){ return a.begin(); } CIter begin() const { return a.begin(); } Iter end(){ return a.end(); } CIter end() const { return a.end(); } int size() const { return a.size(); } bool empty() const { return a.empty(); } Elem& back(){ return a.back(); } const Elem& back() const { return a.back(); } vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; } Iter operator()(int x){ return a.begin() + x; } CIter operator()(int x) const { return a.begin() + x; } View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; } CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; } View operator()(){ return (*this)(0,size()); } CView operator()() const { return (*this)(0,size()); } Elem& operator[](int x){ return a[x]; } const Elem& operator[](int x) const { return a[x]; } Base& operator*(){ return a; } const Base& operator*() const { return a; } vec& push(Elem args){ a.push_back(std::move(args)); return *this; } template vec& emp(Args &&... args){ a.emplace_back(std::forward(args) ...); return *this; } template vec& app(Range& x){ for(auto& v : a) emp(v); } Elem pop(){ Elem x = std::move(a.back()); a.pop_back(); return x; } bool operator==(const vec& r) const { return a == r.a; } bool operator!=(const vec& r) const { return a != r.a; } bool operator<(const vec& r) const { return a < r.a; } bool operator<=(const vec& r) const { return a <= r.a; } bool operator>(const vec& r) const { return a > r.a; } bool operator>=(const vec& r) const { return a >= r.a; } vec> pile(int n) const { return vec>(n, *this); } template vec& filter(F f){ int p = 0; for(int q=0; q IStr& operator>>(IStr& is, vec>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; } template IStr& operator>>(IStr& is, vec& v){ for(auto& x:v){ is >> x; } return is; } template OStr& operator<<(OStr& os, const vec& v){ for(int i=0; i OStr& operator<<(OStr& os, const vec>& v){ for(int i=0; i using namespace std; void testcase(){ int N, M, K; cin >> N >> M >> K; vec S(K+1); cin >> S; for(auto& s : S) s--; auto D = vec(N, INF).pile(N); rep(i,M){ int a,b; i64 c; cin >> a >> b >> c; a--; b--; chmin(D[a][b], c); chmin(D[b][a], c); } rep(i,N) D[i][i] = 0; rep(j,N) rep(i,N) rep(k,N) chmin(D[i][k], D[i][j] + D[j][k]); auto ds = atcoder::fenwick_tree(K); rep(i,K) ds.add(i, D[S[i]][S[i+1]]); int Q; cin >> Q; rep(qi,Q){ int t; cin >> t; if(t == 1){ int x, y; cin >> x >> y; y--; if(x != 0) ds.add(x-1, -D[S[x-1]][S[x]]); if(x != K) ds.add(x, -D[S[x]][S[x+1]]); S[x] = y; if(x != 0) ds.add(x-1, D[S[x-1]][S[x]]); if(x != K) ds.add(x, D[S[x]][S[x+1]]); } else { int x, y; cin >> x >> y; cout << ds.sum(x, y) << '\n'; } } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); #ifdef NACHIA int T; cin >> T; for(int t=0; t