結果
問題 | No.2640 traO Stamps |
ユーザー |
|
提出日時 | 2024-02-19 21:44:59 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 77 ms / 2,000 ms |
コード長 | 8,234 bytes |
コンパイル時間 | 2,965 ms |
コンパイル使用メモリ | 257,404 KB |
実行使用メモリ | 9,968 KB |
最終ジャッジ日時 | 2024-09-29 01:39:51 |
合計ジャッジ時間 | 7,171 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 33 |
ソースコード
#line 1 "template/template.hpp"#include <bits/stdc++.h>#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)#define all(v) (v).begin(), (v).end()#define rall(v) (v).rbegin(), (v).rend()#line 2 "template/debug_template.hpp"#line 4 "template/debug_template.hpp"namespace ebi {#ifdef LOCAL#define debug(...) \std::cerr << "LINE: " << __LINE__ << " [" << #__VA_ARGS__ << "]:", \debug_out(__VA_ARGS__)#else#define debug(...)#endifvoid debug_out() {std::cerr << std::endl;}template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {std::cerr << " " << h;if (sizeof...(t) > 0) std::cerr << " :";debug_out(t...);}} // namespace ebi#line 2 "template/int_alias.hpp"#line 4 "template/int_alias.hpp"namespace ebi {using ld = long double;using std::size_t;using i8 = std::int8_t;using u8 = std::uint8_t;using i16 = std::int16_t;using u16 = std::uint16_t;using i32 = std::int32_t;using u32 = std::uint32_t;using i64 = std::int64_t;using u64 = std::uint64_t;using i128 = __int128_t;using u128 = __uint128_t;} // namespace ebi#line 2 "template/io.hpp"#line 5 "template/io.hpp"#include <optional>#line 7 "template/io.hpp"namespace ebi {template <typename T1, typename T2>std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {return os << pa.first << " " << pa.second;}template <typename T1, typename T2>std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {return os >> pa.first >> pa.second;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");return os;}template <typename T>std::istream &operator>>(std::istream &os, std::vector<T> &vec) {for (T &e : vec) std::cin >> e;return os;}template <typename T>std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {if (opt) {os << opt.value();} else {os << "invalid value";}return os;}void fast_io() {std::cout << std::fixed << std::setprecision(15);std::cin.tie(nullptr);std::ios::sync_with_stdio(false);}} // namespace ebi#line 2 "template/utility.hpp"#line 5 "template/utility.hpp"#line 2 "graph/template.hpp"#line 4 "graph/template.hpp"namespace ebi {template <class T> struct Edge {int to;T cost;Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}};template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {using std::vector<std::vector<Edge<T>>>::vector;void add_edge(int u, int v, T w, bool directed = false) {(*this)[u].emplace_back(v, w);if (directed) return;(*this)[v].emplace_back(u, w);}};struct graph : std::vector<std::vector<int>> {using std::vector<std::vector<int>>::vector;void add_edge(int u, int v, bool directed = false) {(*this)[u].emplace_back(v);if (directed) return;(*this)[v].emplace_back(u);}};} // namespace ebi#line 8 "template/utility.hpp"namespace ebi {template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}template <class T> T safe_ceil(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return (a / b) + 1;elsereturn -((-a) / b);}template <class T> T safe_floor(T a, T b) {if (a % b == 0)return a / b;else if (a >= 0)return a / b;elsereturn -((-a) / b) - 1;}constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;constexpr int INF = std::numeric_limits<int>::max() / 2;const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};} // namespace ebi#line 2 "data_structure/segtree.hpp"#line 5 "data_structure/segtree.hpp"namespace ebi {template <class S, S (*op)(S, S), S (*e)()> struct segtree {private:int n;int sz;std::vector<S> data;void update(int i) {data[i] = op(data[2 * i], data[2 * i + 1]);}public:segtree(int n_) : segtree(std::vector<S>(n_, e())) {}segtree(const std::vector<S> &v) : n((int)v.size()), sz(1) {while (sz < n) sz *= 2;data = std::vector<S>(2 * sz, e());for (int i = 0; i < n; i++) {data[sz + i] = v[i];}for (int i = sz - 1; i >= 1; i--) update(i);}void set(int p, S x) {assert(0 <= p && p < n);p += sz;data[p] = x;while (p > 1) {p >>= 1;update(p);}}S get(int p) const {assert(0 <= p && p < n);return data[p + sz];}S prod(int l, int r) const {assert(0 <= l && l <= r && r <= n);S sml = e(), smr = e();l += sz;r += sz;while (l < r) {if (l & 1) sml = op(sml, data[l++]);if (r & 1) smr = op(data[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() const {return data[1];}template <class F> int max_right(int l, F f) const {assert(0 <= l && l < n);assert(f(e()));if (l == n) return n;l += sz;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, data[l]))) {while (l < sz) {l = 2 * l;if (f(op(sm, data[l]))) {sm = op(sm, data[l]);l++;}}return l - sz;}sm = op(sm, data[l]);l++;} while ((l & -l) != l);return n;}template <class F> int min_left(int r, F f) const {assert(0 <= r && r <= n);assert(f(e()));if (r == 0) return 0;r += sz;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(data[r], sm))) {while (r < sz) {r = 2 * r + 1;if (f(op(data[r], sm))) {sm = op(data[r], sm);r--;}}return r + 1 - sz;}sm = op(data[r], sm);} while ((r & -r) != r);return 0;}S operator[](int p) const {return data[sz + p];}};} // namespace ebi#line 3 "a.cpp"namespace ebi {i64 op(i64 a, i64 b) {return a + b;}i64 e() {return 0;}void main_() {int n,m,k;std::cin >> n >> m >> k;std::vector<int> s(k+1);rep(i,0,k+1) {std::cin >> s[i];s[i]--;}std::vector d(n, std::vector<i64>(n, LNF));rep(i,0,m) {int a, b, c;std::cin >> a >> b >> c;a--; b--;d[a][b] = d[b][a] = c;}rep(i,0,n) d[i][i] = 0;rep(i,0,n) rep(j,0,n) rep(k,0,n) {chmin(d[j][k], d[j][i] + d[i][k]);}segtree<i64, op, e> seg(k);rep(i,0,k) {seg.set(i, d[s[i]][s[i+1]]);}int q;std::cin >> q;while(q--) {int t, x, y;std::cin >> t >> x >> y;if(t == 1) {s[x] = y-1;if(x > 0) {seg.set(x-1, d[s[x-1]][s[x]]);}if(x < k) {seg.set(x, d[s[x]][s[x+1]]);}}else {std::cout << seg.prod(x, y) << '\n';}}}} // namespace ebiint main() {ebi::fast_io();int t = 1;// std::cin >> t;while (t--) {ebi::main_();}return 0;}