結果
問題 | No.2640 traO Stamps |
ユーザー | ZrjaK |
提出日時 | 2024-02-23 15:49:36 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 24,350 bytes |
コンパイル時間 | 5,633 ms |
コンパイル使用メモリ | 315,516 KB |
実行使用メモリ | 9,656 KB |
最終ジャッジ日時 | 2024-09-29 05:10:42 |
合計ジャッジ時間 | 9,597 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 36 ms
9,216 KB |
testcase_07 | AC | 34 ms
8,832 KB |
testcase_08 | AC | 40 ms
9,120 KB |
testcase_09 | AC | 29 ms
6,652 KB |
testcase_10 | AC | 39 ms
9,212 KB |
testcase_11 | AC | 31 ms
6,656 KB |
testcase_12 | AC | 36 ms
9,044 KB |
testcase_13 | AC | 31 ms
6,656 KB |
testcase_14 | AC | 41 ms
9,040 KB |
testcase_15 | AC | 35 ms
6,528 KB |
testcase_16 | AC | 34 ms
8,684 KB |
testcase_17 | AC | 38 ms
8,832 KB |
testcase_18 | AC | 34 ms
6,528 KB |
testcase_19 | AC | 39 ms
9,088 KB |
testcase_20 | AC | 38 ms
9,380 KB |
testcase_21 | AC | 32 ms
6,400 KB |
testcase_22 | AC | 42 ms
8,832 KB |
testcase_23 | AC | 31 ms
6,784 KB |
testcase_24 | AC | 35 ms
6,784 KB |
testcase_25 | AC | 41 ms
9,548 KB |
testcase_26 | AC | 26 ms
8,832 KB |
testcase_27 | AC | 26 ms
8,796 KB |
testcase_28 | AC | 25 ms
8,652 KB |
testcase_29 | AC | 27 ms
8,668 KB |
testcase_30 | AC | 44 ms
9,656 KB |
testcase_31 | AC | 45 ms
9,536 KB |
testcase_32 | AC | 40 ms
9,520 KB |
testcase_33 | AC | 40 ms
9,444 KB |
ソースコード
#ifdef ONLINE_JUDGE#pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("avx2,popcnt")#endif#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = __uint128_t;using f128 = __float128;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using vi = vector<int>;using vvi = vector<vector<int>>;using vll = vector<ll>;using vvll = vector<vector<ll>>;using vpii = vector<pii>;using vpll = vector<pll>;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = std::priority_queue<T>;template <class T>using pqg = std::priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))#define lb lower_bound#define ub upper_bound#define pb push_back#define eb emplace_back#define fi first#define se second#define mp make_pair#define mt make_tuple#define stoi stoll#define overload4(_1, _2, _3, _4, name, ...) name#define overload3(_1, _2, _3, name, ...) name#define rep1(n) for(ll _ = 0; _ < n; ++_)#define rep2(i, n) for(ll i = 0; i < n; ++i)#define rep3(i, a, b) for(ll i = a; i < b; ++i)#define rep4(i, a, b, c) for(int i = a; i < b; i += c)#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1) (__VA_ARGS__)#define rrep1(n) for(ll i = n; i--; )#define rrep2(i, n) for(ll i = n; i--; )#define rrep3(i, a, b) for(ll i = a; i > b; i--)#define rrep4(i, a, b, c) for(ll i = a; i > b; i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) (__VA_ARGS__)#define each1(i, a) for(auto&& i : a)#define each2(x, y, a) for(auto&& [x, y] : a)#define each3(x, y, z, a) for(auto&& [x, y, z] : a)#define each(...) overload4(__VA_ARGS__, each3, each2, each1) (__VA_ARGS__)#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1) (__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R) (__VA_ARGS__)#define FOR_subset(t, s) for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define len(x) ll(x.size())#define elif else if#define all1(i) begin(i), end(i)#define all2(i, a) begin(i), begin(i) + a#define all3(i, a, b) begin(i) + a, begin(i) + b#define all(...) overload3(__VA_ARGS__, all3, all2, all1) (__VA_ARGS__)#define rall1(i) rbegin(i), rend(i)#define rall2(i, a) rbegin(i), rbegin(i) + a#define rall3(i, a, b) rbegin(i) + a, rbegin(i) + b#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1) (__VA_ARGS__)#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()#define SORT(a) sort(all(a))#define REV(a) reverse(all(a))int popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template<class T> auto max(const T& a){ return *max_element(all(a)); }template<class T> auto min(const T& a){ return *min_element(all(a)); }template <typename T, typename U>T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}template <typename T, typename U>T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}template <typename T, typename U>pair<T, T> divmod(T x, U y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sum = 0;for (auto &&a: A) sum += a;return sum;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);for (int i = 0; i < N; i++) B[i + 1] = B[i] + A[i];if (off == 0) B.erase(B.begin());return B;}template <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {assert(!que.empty());T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {assert(!que.empty());T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {while (iter--) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }template <typename Iterable>auto print_all(const Iterable& v, std::string sep = " ", std::string end = "\n") -> decltype(fastio::wt(*v.begin())) {for (auto it = v.begin(); it != v.end();) {fastio::wt(*it);if (++it != v.end()) fastio::wt(sep);}fastio::wt(end);}vvi getGraph(int n, int m, bool directed = false) {vvi res(n);rep(_, 0, m) {INT(u, v);u--, v--;res[u].emplace_back(v);if(!directed) res[v].emplace_back(u);}return res;}vector<vpii> getWeightedGraph(int n, int m, bool directed = false) {vector<vpii> res(n);rep(_, 0, m) {INT(u, v, w);u--, v--;res[u].emplace_back(v, w);if(!directed) res[v].emplace_back(u, w);}return res;}template <class... Args> auto ndvector(size_t n, Args &&...args) {if constexpr (sizeof...(args) == 1) {return vector(n, args...);} else {return vector(n, ndvector(args...));}}#line 2 "graph/base.hpp"template <typename T>struct Edge {int frm, to;T cost;int id;};template <typename T = int, bool directed = false>struct Graph {static constexpr bool is_directed = directed;int N, M;using cost_type = T;using edge_type = Edge<T>;vector<edge_type> edges;vector<int> indptr;vector<edge_type> csr_edges;vc<int> vc_deg, vc_indeg, vc_outdeg;bool prepared;class OutgoingEdges {public:OutgoingEdges(const Graph* G, int l, int r) : G(G), l(l), r(r) {}const edge_type* begin() const {if (l == r) { return 0; }return &G->csr_edges[l];}const edge_type* end() const {if (l == r) { return 0; }return &G->csr_edges[r];}private:const Graph* G;int l, r;};bool is_prepared() { return prepared; }Graph() : N(0), M(0), prepared(0) {}Graph(int N) : N(N), M(0), prepared(0) {}void build(int n) {N = n, M = 0;prepared = 0;edges.clear();indptr.clear();csr_edges.clear();vc_deg.clear();vc_indeg.clear();vc_outdeg.clear();}void add(int frm, int to, T cost = 1, int i = -1) {assert(!prepared);assert(0 <= frm && 0 <= to && to < N);if (i == -1) i = M;auto e = edge_type({frm, to, cost, i});edges.eb(e);++M;}#ifdef FASTIO// wt, offvoid read_tree(bool wt = false, int off = 1) { read_graph(N - 1, wt, off); }void read_graph(int M, bool wt = false, int off = 1) {for (int m = 0; m < M; ++m) {INT(a, b);a -= off, b -= off;if (!wt) {add(a, b);} else {T c;read(c);add(a, b, c);}}build();}#endifvoid build() {assert(!prepared);prepared = true;indptr.assign(N + 1, 0);for (auto&& e: edges) {indptr[e.frm + 1]++;if (!directed) indptr[e.to + 1]++;}for (int v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }auto counter = indptr;csr_edges.resize(indptr.back() + 1);for (auto&& e: edges) {csr_edges[counter[e.frm]++] = e;if (!directed)csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});}}OutgoingEdges operator[](int v) const {assert(prepared);return {this, indptr[v], indptr[v + 1]};}vc<int> deg_array() {if (vc_deg.empty()) calc_deg();return vc_deg;}pair<vc<int>, vc<int>> deg_array_inout() {if (vc_indeg.empty()) calc_deg_inout();return {vc_indeg, vc_outdeg};}int deg(int v) {if (vc_deg.empty()) calc_deg();return vc_deg[v];}int in_deg(int v) {if (vc_indeg.empty()) calc_deg_inout();return vc_indeg[v];}int out_deg(int v) {if (vc_outdeg.empty()) calc_deg_inout();return vc_outdeg[v];}#ifdef FASTIOvoid debug() {print("Graph");if (!prepared) {print("frm to cost id");for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);} else {print("indptr", indptr);print("frm to cost id");FOR(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);}}#endifvc<int> new_idx;vc<bool> used_e;// G における頂点 V[i] が、新しいグラフで i になるようにする// {G, es}Graph<T, directed> rearrange(vc<int> V, bool keep_eid = 0) {if (len(new_idx) != N) new_idx.assign(N, -1);if (len(used_e) != M) used_e.assign(M, 0);int n = len(V);FOR(i, n) new_idx[V[i]] = i;Graph<T, directed> G(n);vc<int> history;FOR(i, n) {for (auto&& e: (*this)[V[i]]) {if (used_e[e.id]) continue;int a = e.frm, b = e.to;if (new_idx[a] != -1 && new_idx[b] != -1) {history.eb(e.id);used_e[e.id] = 1;int eid = (keep_eid ? e.id : -1);G.add(new_idx[a], new_idx[b], e.cost, eid);}}}FOR(i, n) new_idx[V[i]] = -1;for (auto&& eid: history) used_e[eid] = 0;G.build();return G;}private:void calc_deg() {assert(vc_deg.empty());vc_deg.resize(N);for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;}void calc_deg_inout() {assert(vc_indeg.empty());vc_indeg.resize(N);vc_outdeg.resize(N);for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }}};#line 3 "graph/shortest_path/warshall_floyd.hpp"// 負辺があっても負閉路がなければ正しく動作する。// 負閉路があるかどうかは、dist[v][v] < 0 となる v があるかどうかで判定。template <typename T, typename GT>vc<vc<T>> warshall_floyd(GT& G) {ll N = G.N;vv(T, dist, N, N, infty<T>);FOR(v, N) {dist[v][v] = 0;for (auto&& e: G[v]) chmin(dist[v][e.to], e.cost);}FOR(k, N) FOR(i, N) {if (dist[i][k] == infty<T>) continue;FOR(j, N) {if (dist[k][j] == infty<T>) continue;chmin(dist[i][j], dist[i][k] + dist[k][j]);}}return dist;}#line 2 "ds/segtree/segtree.hpp"template <class Monoid>struct SegTree {using MX = Monoid;using X = typename MX::value_type;using value_type = X;vc<X> dat;int n, log, size;SegTree() {}SegTree(int n) { build(n); }template <typename F>SegTree(int n, F f) {build(n, f);}SegTree(const vc<X>& v) { build(v); }void build(int m) {build(m, [](int i) -> X { return MX::unit(); });}void build(const vc<X>& v) {build(len(v), [&](int i) -> X { return v[i]; });}template <typename F>void build(int m, F f) {n = m, log = 1;while ((1 << log) < n) ++log;size = 1 << log;dat.assign(size << 1, MX::unit());FOR(i, n) dat[size + i] = f(i);FOR_R(i, 1, size) update(i);}X get(int i) { return dat[size + i]; }vc<X> get_all() { return {dat.begin() + size, dat.begin() + size + n}; }void update(int i) { dat[i] = Monoid::op(dat[2 * i], dat[2 * i + 1]); }void set(int i, const X& x) {assert(i < n);dat[i += size] = x;while (i >>= 1) update(i);}void multiply(int i, const X& x) {assert(i < n);i += size;dat[i] = Monoid::op(dat[i], x);while (i >>= 1) update(i);}X prod(int L, int R) {assert(0 <= L && L <= R && R <= n);X vl = Monoid::unit(), vr = Monoid::unit();L += size, R += size;while (L < R) {if (L & 1) vl = Monoid::op(vl, dat[L++]);if (R & 1) vr = Monoid::op(dat[--R], vr);L >>= 1, R >>= 1;}return Monoid::op(vl, vr);}X prod_all() { return dat[1]; }template <class F>int max_right(F check, int L) {assert(0 <= L && L <= n && check(Monoid::unit()));if (L == n) return n;L += size;X sm = Monoid::unit();do {while (L % 2 == 0) L >>= 1;if (!check(Monoid::op(sm, dat[L]))) {while (L < size) {L = 2 * L;if (check(Monoid::op(sm, dat[L]))) { sm = Monoid::op(sm, dat[L++]); }}return L - size;}sm = Monoid::op(sm, dat[L++]);} while ((L & -L) != L);return n;}template <class F>int min_left(F check, int R) {assert(0 <= R && R <= n && check(Monoid::unit()));if (R == 0) return 0;R += size;X sm = Monoid::unit();do {--R;while (R > 1 && (R % 2)) R >>= 1;if (!check(Monoid::op(dat[R], sm))) {while (R < size) {R = 2 * R + 1;if (check(Monoid::op(dat[R], sm))) { sm = Monoid::op(dat[R--], sm); }}return R + 1 - size;}sm = Monoid::op(dat[R], sm);} while ((R & -R) != R);return 0;}// prod_{l<=i<r} A[i xor x]X xor_prod(int l, int r, int xor_val) {static_assert(Monoid::commute);X x = Monoid::unit();for (int k = 0; k < log + 1; ++k) {if (l >= r) break;if (l & 1) { x = Monoid::op(x, dat[(size >> k) + ((l++) ^ xor_val)]); }if (r & 1) { x = Monoid::op(x, dat[(size >> k) + ((--r) ^ xor_val)]); }l /= 2, r /= 2, xor_val /= 2;}return x;}};#line 2 "alg/monoid/add.hpp"template <typename E>struct Monoid_Add {using X = E;using value_type = X;static constexpr X op(const X &x, const X &y) noexcept { return x + y; }static constexpr X inverse(const X &x) noexcept { return -x; }static constexpr X power(const X &x, ll n) noexcept { return X(n) * x; }static constexpr X unit() { return X(0); }static constexpr bool commute = true;};void solve() {INT(n, m, k);VEC(int, S, k + 1);each(i, S) i--;Graph G(n);G.read_graph(m, true);auto dist = warshall_floyd<ll>(G);SegTree<Monoid_Add<ll>> seg(k);rep(i, k) {seg.set(i, dist[S[i]][S[i + 1]]);}INT(Q);rep(Q) {INT(t, x, y);if (t == 1) {y--;S[x] = y;if (x < k) seg.set(x, dist[S[x]][S[x + 1]]);if (x) seg.set(x - 1, dist[S[x - 1]][S[x]]);}if (t == 2) {print(seg.prod(x, y));}}}signed main() {int T = 1;// read(T);while (T--) {solve();}return 0;}