結果
問題 | No.2640 traO Stamps |
ユーザー |
👑 ![]() |
提出日時 | 2024-02-19 22:19:02 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 251 ms / 2,000 ms |
コード長 | 4,094 bytes |
コンパイル時間 | 18,179 ms |
コンパイル使用メモリ | 265,148 KB |
最終ジャッジ日時 | 2025-02-19 17:08:04 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 33 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>// using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll op(ll a, ll b) { return a + b; }ll e() { return 0LL; }int main() {ll N, M, K;cin >> N >> M >> K;vector<ll> S(K + 1);for (ll i = 0; i < K + 1; i++) {cin >> S[i];S[i]--;}vector<ll> A(M);vector<ll> B(M);vector<ll> C(M);for (ll i = 0; i < M; i++) {cin >> A[i] >> B[i] >> C[i];A[i]--;B[i]--;}ll Q;cin >> Q;vector<ll> T(Q);vector<ll> X(Q);vector<ll> Y(Q);for (ll i = 0; i < Q; i++) {cin >> T[i] >> X[i] >> Y[i];}ll INF = 100000000000024;vector<vector<ll>> dist(N, vector<ll>(N, INF));for (ll i = 0; i < N; i++){dist[i][i] = 0;}for (ll i = 0; i < M; i++) {dist[A[i]][B[i]] = C[i];dist[B[i]][A[i]] = C[i];}for (ll k = 0; k < N; k++) {for (ll i = 0; i < N; i++) {for (ll j = 0; j < N; j++) {dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);}}}segtree<ll, op, e> seg(K);for (ll i = 0; i < K; i++) {seg.set(i, dist[S[i]][S[i + 1]]);}for (ll i = 0; i < Q; i++) {if (T[i] == 1) {S[X[i]] = Y[i] - 1;if (X[i] > 0) {seg.set(X[i] - 1, dist[S[X[i] - 1]][Y[i] - 1]);}if (X[i] < K) {seg.set(X[i], dist[Y[i] - 1][S[X[i] + 1]]);}} else {cout << seg.prod(X[i], Y[i]) << endl;}}}