#953331 (C++14) No.2640 traO Stamps

• 問題: No.2640 traO Stamps
• ユーザー: tnakao0123
• 提出日時: 2024-02-20 18:07:47
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 109 ms / 2,000 ms
• コード長: 2,335 bytes
• コンパイル時間: 575 ms
• コンパイル使用メモリ: 55,952 KB
• 実行使用メモリ: 8,156 KB
• 最終ジャッジ日時: 2024-09-29 03:48:42
• 合計ジャッジ時間: 6,030 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 33

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/* -*- coding: utf-8 -*-
 *
 * 2640.cc:  No.2640 traO Stamps - yukicoder
 */
#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;
/* constant */
const int MAX_N = 200;
const int MAX_K = 200000;
const long long LINF = 1LL << 60;
/* typedef */
typedef long long ll;
typedef vector<int> vi;
template <typename T>
struct SegTreeSum {
  int e2;
  vector<T> nodes;
  T defv;
  SegTreeSum() {}
  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
  }
  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }
  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
  }
  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];
    }
  }
  T sum_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];
    int im = (i0 + i1) / 2;
    T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }
};
/* global variables */
int ss[MAX_K + 1];
ll ds[MAX_N][MAX_N];
SegTreeSum<ll> st;
/* subroutines */
/* main */
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i <= k; i++) scanf("%d", ss + i), ss[i]--;
  for (int i = 0; i < n; i++)
    fill(ds[i], ds[i] + n, LINF), ds[i][i] = 0;
  ;
  for (int i = 0; i < m; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    u--, v--;
    ds[u][v] = ds[v][u] = w;
  }
  for (int l = 0; l < n; l++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
    ds[i][j] = min(ds[i][j], ds[i][l] + ds[l][j]);
  st.init(k, 0);
  for (int i = 0; i < k; i++) st.seti(i, ds[ss[i]][ss[i + 1]]);
  st.setall();
  
  int qn;
  scanf("%d", &qn);
  while (qn--) {
    int op, x, y;
    scanf("%d%d%d", &op, &x, &y);
    if (op == 1) {
      y--;
      ss[x] = y;
      if (x > 0) st.set(x - 1, ds[ss[x - 1]][ss[x]]);
      if (x < k) st.set(x, ds[ss[x]][ss[x + 1]]);
    }
    else {
      auto e = st.sum_range(x, y);
      printf("%lld\n", e);
    }
  }
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX