結果
問題 | No.2640 traO Stamps |
ユーザー |
|
提出日時 | 2024-02-19 21:35:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 78 ms / 2,000 ms |
コード長 | 7,502 bytes |
コンパイル時間 | 2,239 ms |
コンパイル使用メモリ | 205,812 KB |
最終ジャッジ日時 | 2025-02-19 16:42:34 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 33 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;template <typename T, bool directed = false>struct Warshall_Floyd {vector<vector<T>> es;const T zero_T, INF_T;const int n;inline const vector<T> &operator[](int k) const { return es[k]; }inline vector<T> &operator[](int k) { return es[k]; }Warshall_Floyd(int n, T zero_T = 0, T INF_T = numeric_limits<T>::max() / 2) : es(n, vector<T>(n)), zero_T(zero_T), INF_T(INF_T), n(n) {for (int i = 0; i < n; i++) fill(begin(es[i]), end(es[i]), INF_T);for (int i = 0; i < n; i++) es[i][i] = zero_T;}void add_edge(int from, int to, T cost = 1) {es[from][to] = min(es[from][to], cost);if (!directed) es[to][from] = min(es[to][from], cost);}vector<vector<T>> shortest_path() {for (int k = 0; k < n; k++) {for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {if (es[i][k] == INF_T || es[k][j] == INF_T) continue;es[i][j] = min(es[i][j], es[i][k] + es[k][j]);}}}return es;}};template <typename T>struct Binary_Indexed_Tree {vector<T> bit;const int n;Binary_Indexed_Tree(const vector<T> &v) : n((int)v.size()) {bit.resize(n + 1);copy(begin(v), end(v), begin(bit) + 1);build();}Binary_Indexed_Tree(int n, T x = 0) : Binary_Indexed_Tree(vector<T>(n, x)) {}void set(int i, const T &x) { bit[i + 1] = x; }void build() {for (int a = 2; a <= n; a <<= 1) {for (int b = a; b <= n; b += a) bit[b] += bit[b - a / 2];}}void add(int i, const T &x) {for (i++; i <= n; i += (i & -i)) bit[i] += x;}void change(int i, const T &x) { add(i, x - query(i, i + 1)); }T sum(int i) const {i = min(i, n);if (i <= 0) return 0;T ret = 0;for (; i > 0; i -= (i & -i)) ret += bit[i];return ret;}T query(int l, int r) const {l = max(l, 0), r = min(r, n);if (l >= r) return 0;return sum(r) - sum(l);}T operator[](int i) const { return query(i, i + 1); }// v[0]+...+v[r] >= x を満たす最小の r (なければ n)int lower_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] < x) x -= bit[ret += (1 << k)];}return ret;}// v[0]+...+v[r] > x を満たす最小の r (なければ n)int upper_bound(T x) const {int ret = 0;for (int k = 31 - __builtin_clz(n); k >= 0; k--) {if (ret + (1 << k) <= n && bit[ret + (1 << k)] <= x) x -= bit[ret += (1 << k)];}return ret;}};void solve() {int N, M, K;cin >> N >> M >> K;vector<int> a(K + 1);rep(i, K + 1) cin >> a[i], a[i]--;Warshall_Floyd<ll> G(N);rep(i, M) {int u, v;ll c;cin >> u >> v >> c;u--, v--;G.add_edge(u, v, c);}auto d = G.shortest_path();vector<ll> v(K);rep(i, K) v[i] = d[a[i]][a[i + 1]];Binary_Indexed_Tree<ll> bit(v);int Q;cin >> Q;while (Q--) {int t;cin >> t;if (t == 1) {int x, y;cin >> x >> y;y--;if (x > 0) bit.change(x - 1, d[a[x - 1]][y]);if (x < K) bit.change(x, d[y][a[x + 1]]);a[x] = y;} else {int l, r;cin >> l >> r;cout << bit.query(l, r) << '\n';}}}int main() {int T = 1;// cin >> T;while (T--) solve();}