Legacy

http://codeforces.com/problemset/problem/786/B
B. Legacy
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wants to give his legacy to Morty before bad guys catch them.

There are n planets in their universe numbered from 1 to n. Rick is in planet number s (the earth) and he doesn’t know where Morty is. As we all know, Rick owns a portal gun. With this gun he can open one-way portal from a planet he is in to any other planet (including that planet). But there are limits on this gun because he’s still using its free trial.

By default he can not open any portal by this gun. There are q plans in the website that sells these guns. Every time you purchase a plan you can only use it once but you can purchase it again if you want to use it more.

Plans on the website have three types:

With a plan of this type you can open a portal from planet v to planet u.
With a plan of this type you can open a portal from planet v to any planet with index in range [l, r].
With a plan of this type you can open a portal from any planet with index in range [l, r] to planet v. 

Rick doesn’t known where Morty is, but Unity is going to inform him and he wants to be prepared for when he finds and start his journey immediately. So for each planet (including earth itself) he wants to know the minimum amount of money he needs to get from earth to that planet.
Input

The first line of input contains three integers n, q and s (1 ≤ n, q ≤ 105, 1 ≤ s ≤ n) — number of planets, number of plans and index of earth respectively.

The next q lines contain the plans. Each line starts with a number t, type of that plan (1 ≤ t ≤ 3). If t = 1 then it is followed by three integers v, u and w where w is the cost of that plan (1 ≤ v, u ≤ n, 1 ≤ w ≤ 109). Otherwise it is followed by four integers v, l, r and w where w is the cost of that plan (1 ≤ v ≤ n, 1 ≤ l ≤ r ≤ n, 1 ≤ w ≤ 109).
Output

In the first and only line of output print n integers separated by spaces. i-th of them should be minimum money to get from earth to i-th planet, or  - 1 if it’s impossible to get to that planet.
Examples
Input
Copy

3 5 1
2 3 2 3 17
2 3 2 2 16
2 2 2 3 3
3 3 1 1 12
1 3 3 17

Output

0 28 12

Input
Copy

4 3 1
3 4 1 3 12
2 2 3 4 10
1 2 4 16

Output

0 -1 -1 12

Note

In the first sample testcase, Rick can purchase 4th plan once and then 2nd plan in order to get to get to planet number 2.

题解

线段树优化建图+堆优化dj

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ROOT 1,1,n
#define LSON root<<1,l,mid
#define RSON root<<1|1,mid+1,r
using namespace std;
typedef long long ll;
const int maxn=5000000+5;
struct node
{
    int x; ll w;
    bool operator <(const node &o)const
    {
        return w>o.w;
    }
};
priority_queue <node> p;
bool used[maxn];
vector<node> v[maxn];
void add1(int i,int j,int w)
{
    v[i].push_back((node){j,w});
}
int n,m,s,max1;
void build1(int root,int l,int r)
{
    max1=max(max1,root);
    if(l==r)
    {
        add1(root+n,l,0); return;
    }
    int mid=(l+r)>>1;
    build1(LSON); build1(RSON);
    add1(root+n,(root<<1)+n,0); add1(root+n,(root<<1|1)+n,0);
}
void build2(int root,int l,int r)
{
    if(l==r)
    {
        add1(l,root+n+max1,0); return;
    }
    int mid=(l+r)>>1;
    build2(LSON); build2(RSON);
    add1((root<<1)+n+max1,root+n+max1,0); add1((root<<1|1)+n+max1,root+n+max1,0);
}
void modify1(int root,int l,int r,int L,int R,int k,int w)
{
    if(L<=l && r<=R)
    {
        add1(k,root+n,w); return;
    }
    int mid=(l+r)>>1;
    if(R<=mid) modify1(LSON,L,R,k,w);
    else if(L>mid) modify1(RSON,L,R,k,w);
    else modify1(LSON,L,R,k,w),modify1(RSON,L,R,k,w);
}
void modify2(int root,int l,int r,int L,int R,int k,int w)
{
    if(L<=l && r<=R)
    {
        add1(root+n+max1,k,w); return;
    }
    int mid=(l+r)>>1;
    if(R<=mid) modify2(LSON,L,R,k,w);
    else if(L>mid) modify2(RSON,L,R,k,w);
    else modify2(LSON,L,R,k,w),modify2(RSON,L,R,k,w);
}
ll dis[maxn],inf;
int main()
{
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    build1(ROOT); build2(ROOT);
    for(int i=1; i<=m; i++)
    {
        int opt; scanf("%d",&opt);
        if(opt==1)
        {
            int x,y,w; scanf("%d %d %d",&x,&y,&w);
            if(x!=y) add1(x,y,w);
        }
        else if(opt==2)
        {
            int l,r,x,w; scanf("%d %d %d %d",&x,&l,&r,&w);
            modify1(ROOT,l,r,x,w);
        }
        else
        {
            int l,r,x,w; scanf("%d %d %d %d",&x,&l,&r,&w);
            modify2(ROOT,l,r,x,w);
        }
    }
    memset(dis,62,sizeof(dis));
    inf=dis[0];
    dis[s]=0;
    p.push((node){s,0});
    while(!p.empty())
    {
        node c=p.top(); p.pop();
        if(used[c.x]) continue;
        else
        {
            used[c.x]=true;
            if(!v[c.x].empty())
            {
                for(int i=0; i<v[c.x].size(); i++)
                {
                    node now=v[c.x][i];
                    if(dis[now.x]>dis[c.x]+now.w)
                    {
                        dis[now.x]=dis[c.x]+now.w;
                        p.push((node){now.x,dis[now.x]});
                    }
                }
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        if(dis[i]!=inf)
        {
            printf("%I64d ",dis[i]);
        }
        else
        {
            printf("-1 ");
        }
    }
    return 0;
}