Submission #1062958

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

#define INF INT_MAX/3
vector<vector<int> > d; // 隣接行列 適宜0とかINFとか
int n, m; // 頂点数

void warshall_floyd() {
  rep (k, n) {
    rep (i, n) {
      rep (j, n) {
        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
}

int main() {
  scanf("%d %d", &n, &m);
  d.assign(n, vi(n, INF));
  rep (i, n) {
    d[i][i] = 0;
  }
  rep (i, m) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    a -= 1; b -= 1;
    d[a][b] = d[b][a] = c;
  }
  warshall_floyd();
  ll s = 0;
  rep (i, n) {
    FOR (j, i+1, n) {
      s += d[i][j];
    }
  }

  int k;
  scanf("%d", &k);
  rep (query, k) {
    int x, y, z;
    scanf("%d %d %d", &x, &y, &z);
    x -= 1; y -= 1;
    if (x > y) {
      swap(x, y);
    }
    if (d[x][y] <= z) {
      printf("%lld\n", s);
      continue;
    }
    s = s - d[x][y] + z;
    d[x][y] = d[y][x] = z;
    rep (i, n) {
      FOR (j, i+1, n) {
        int new_cost = d[i][j];
        new_cost = min(new_cost, d[i][x] + d[x][y] + d[y][j]);
        new_cost = min(new_cost, d[i][y] + d[y][x] + d[x][j]);
        if (new_cost < d[i][j]) {
          s = s - d[i][j] + new_cost;
          d[i][j] = d[j][i] = new_cost;
        }
      }
    }
    printf("%lld\n", s);
  }

  return 0;
}

Submission Info

Judge Result