线段树建图+spfa

CodeForces-787D

直接暴力的话，边数太多，spfa 会炸掉.

由于涉及到区间操作，不妨利用线段树建图，之后再spfa即可.

线段树建图需建两棵树 – 出度树 和 入度树.

#include <stdio.h>
#include <vector>
#include <queue>
#define ls rt << 1
#define rs rt << 1 | 1
#include <algorithm>
using namespace std;
typedef long long LL;
typedef pair<int,LL> PIL;
const int N = 1e5 + 7;
vector<PIL> G[N*5];
LL INF = 1ll<<62;
int idx[2][N*4], root[2];
int vis[N*5];
int n, m, s, cnt;
LL dis[N*5];
void adg(int x, int y, int w)
{
 G[x].push_back(PIL(y, w));
}
void build(int type, int &pos, int l = 1, int r = n, int rt = 1)
{
 pos = ++ cnt;
 if (l == r)
 {
  if (!type) adg(pos, l, 0);
  else adg(l, pos, 0);
  return ;
 }
 int mid = l + r >> 1;
 build(type,idx[type][ls], l, mid, ls);
 build(type, idx[type][rs], mid + 1, r, rs);
 if (!type) adg(idx[type][rt], idx[type][ls], 0), adg(idx[type][rt], idx[type][rs], 0);
 else adg(idx[type][ls], idx[type][rt], 0), adg(idx[type][rs], idx[type][rt], 0);
}
void updata(int L, int R, int v, int val, int type, int l = 1, int r = n, int rt = 1)
{
 if (L <= l && r <= R)
 {
  if (!type) adg(v, idx[type][rt], val);
  else adg(idx[type][rt], v, val);
  return ;
 }
 int mid = l + r >> 1;
 if (L <= mid) updata(L, R, v, val ,type, l, mid, ls);
 if (R > mid) updata(L, R, v, val ,type, mid + 1, r, rs);
}
void spfa()
{
 for (int i = 1; i <= cnt; i ++ ) dis[i] = INF;
 queue<int> st;
 dis[s] = 0;
 st.push(s);
 while (!st.empty())
 {
  int x = st.front();
  st.pop();
  vis[x] = 0;
  for (int i = 0; i < G[x].size(); i ++ )
  {
   int v = G[x][i].first;
   if (dis[v] > dis[x] + G[x][i].second)
   {
    dis[v] = dis[x] + G[x][i].second;
    if (!vis[v]) st.push(v), vis[v] = 1;
   }
  }
 }
}
int main ()
{
 scanf ("%d%d%d", &n, &m, &s);
 cnt = n;
 build(0, root[0]);
 build(1, root[1]); 
 for (int i = 1; i <= m; i ++ )
 {
  int v, l, r, val, type;
  scanf ("%d", &type);
  if (type == 1)
  {
   scanf ("%d%d%d", &v, &l, &val);
   adg(v, l, val);
  }
  else if (type == 2)
  {
   scanf ("%d%d%d%d", &v, &l, &r, &val);
   updata(l, r, v, val, 0);
  }
  else 
  {
   scanf ("%d%d%d%d", &v, &l, &r, &val);
   updata(l, r, v, val, 1);
  }
 }
 spfa();
 for (int i = 1; i <= n; i ++ )
  printf ("%lld%c", dis[i] == INF ? -1 : dis[i], i == n ? '\n' : ' ');
 return 0;
}