D. 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:

  1. With a plan of this type you can open a portal from planet v to planet u.
  2. With a plan of this type you can open a portal from planet v to any planet with index in range [l, r].
  3. 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 nq 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 vu and w where w is the cost of that plan (1 ≤ v, u ≤ n, 1 ≤ w ≤ 109). Otherwise it is followed by four integers vlr and wwhere 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
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
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.

题目链接:点击传送

题意:给你n个点,q个操作,s为起点

   t表示操作类型,1 v->u的权值为w ,2  v -> [l,r](区间所有点)的权值为w ,3 [l,r] -> v 的权值为w;

思路:

根据线段树的区间进行修改即可;

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-4
#define bug(x) cout<<"bug"<<x<<endl;
const int N=1e5+,M=1e6+,inf=;
const ll INF=1e17+,mod=1e9+;
struct is
{
int v,next;
ll w;
}edge[M*];
int head[N*],edg,vis[M];
void init()
{
memset(vis,,sizeof(vis));
memset(head,-,sizeof(head));
edg=;
}
void add(int u,int v,ll w)
{
edg++;
edge[edg].v=v;
edge[edg].w=w;
edge[edg].next=head[u];
head[u]=edg;
}
struct SGT
{
int ls[N*][],rs[N*][],root[];
int tot;
void build(int l,int r,int &pos,int type)
{
pos=tot++;
if(l==r)
{
if(type)
add(l,pos,);
else
add(pos,l,);
return;
}
int mid=(l+r)>>;
build(l,mid,ls[pos][type],type);
build(mid+,r,rs[pos][type],type);
if(type)
add(ls[pos][type],pos,),add(rs[pos][type],pos,);
else
add(pos,ls[pos][type],),add(pos,rs[pos][type],);
}
void up(int v,int L,int R,ll c,int l,int r,int pos)
{
if(L<=l&&r<=R)
{
//cout<<"add"<<v<<" "<<pos<<endl;
add(pos,v,c);
return;
}
int mid=(l+r)>>;
if(L<=mid)
up(v,L,R,c,l,mid,ls[pos][]);
if(R>mid)
up(v,L,R,c,mid+,r,rs[pos][]);
}
void down(int v,int L,int R,ll c,int l,int r,int pos)
{
if(L<=l&&r<=R)
{
//cout<<"add"<<v<<" "<<pos<<endl;
add(v,pos,c);
return;
}
int mid=(l+r)>>;
if(L<=mid)
down(v,L,R,c,l,mid,ls[pos][]);
if(R>mid)
down(v,L,R,c,mid+,r,rs[pos][]);
}
};
SGT tree;
struct mmp
{
int s;
ll dis;
mmp(){}
mmp(int ss,ll d){s=ss,dis=d;}
bool operator <(const mmp &b)const
{
return dis>b.dis;
}
};
ll ans[N*];
priority_queue<mmp>q;
void dij(int s)
{
ans[s]=;
q.push(mmp(s,0LL));
while(!q.empty())
{
mmp now = q.top();
q.pop();
if(vis[now.s])continue;
vis[now.s]=;
for(int i = head[now.s]; i !=-; i = edge[i].next)
{
int v=edge[i].v;
ll w=edge[i].w;
if(ans[v] > ans[now.s] + w)
{
q.push(mmp(v,ans[now.s]+w));
ans[v]=ans[now.s]+w;
}
}
}
}
int main()
{
init();
int n,q,s;
scanf("%d%d%d",&n,&q,&s);
for(int i=;i<=n*;i++)
ans[i]=INF;
tree.tot=n+;
tree.build(,n,tree.root[],);
tree.build(,n,tree.root[],);
for(int i=;i<=q;i++)
{
int t,v,u,l,r;
ll w;
scanf("%d%d",&t,&v);
if(t==)
scanf("%d%lld",&u,&w),add(v,u,w);
else if(t==)
scanf("%d%d%lld",&l,&r,&w),tree.down(v,l,r,w,,n,tree.root[]);
else
scanf("%d%d%lld",&l,&r,&w),tree.up(v,l,r,w,,n,tree.root[]);
}
dij(s);
for(int i=;i<=n;i++)
{
if(ans[i]>=INF)printf("-1 ");
else printf("%lld ",ans[i]);
}
printf("\n");
return ;
}
 

Codeforces Round #406 (Div. 2) D. Legacy 线段树建模+最短路的更多相关文章

  1. Codeforces Round #406 (Div. 1) B. Legacy 线段树建图跑最短路

    B. Legacy 题目连接: http://codeforces.com/contest/786/problem/B Description Rick and his co-workers have ...

  2. 【转】Codeforces Round #406 (Div. 1) B. Legacy 线段树建图&&最短路

    B. Legacy 题目连接: http://codeforces.com/contest/786/problem/B Description Rick and his co-workers have ...

  3. Codeforces Round #406 (Div. 2) D. Legacy (线段树建图dij)

    D. Legacy time limit per test 2 seconds memory limit per test 256 megabytes input standard input out ...

  4. Codeforces Round #406 (Div. 2) 787-D. Legacy

    Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So ...

  5. Codeforces Round #603 (Div. 2) E. Editor 线段树

    E. Editor The development of a text editor is a hard problem. You need to implement an extra module ...

  6. Codeforces Codeforces Round #316 (Div. 2) C. Replacement 线段树

    C. ReplacementTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/570/problem ...

  7. Codeforces Round #765 Div.1 F. Souvenirs 线段树

    题目链接:http://codeforces.com/contest/765/problem/F 题意概述: 给出一个序列,若干组询问,问给出下标区间中两数作差的最小绝对值. 分析: 这个题揭示着数据 ...

  8. Codeforces Round #278 (Div. 1) Strip (线段树 二分 RMQ DP)

    Strip time limit per test 1 second memory limit per test 256 megabytes input standard input output s ...

  9. Codeforces 787D. Legacy 线段树建模+最短路

    D. Legacy time limit per test:2 seconds memory limit per test:256 megabytes input:standard input out ...

随机推荐

  1. SQLAlchemy通过models创建数据库表

    原地址:http://blog.csdn.net/jmilk/article/details/53184903 定义数据模型 models SQLAlchemy 允许我们根据数据库的表结构来创建数据模 ...

  2. spring的bean容器加载

    1.在单独使用的时候可以通过ClassPathXmlApplicationContext(“配置文件.xml”);来启动容器. 2.在MVC下是通过启动servlet容器,初始化DispatcherS ...

  3. 置换检验(Permutation Test)学习[转载]

    转自:https://www.cnblogs.com/bnuvincent/p/6813785.html http://www.bioinfo-scrounger.com/archives/564 1 ...

  4. 从 Zero 到 Hero ,一文掌握 Python

    译文:开源中国 www.oschina.net/translate/learning-python-from-zero-to-hero 第一个问题,什么是 Python ?根据 Python 之父 G ...

  5. selenium3启动浏览器

    selenium3比2更加标准化,支持的浏览器更多,启动浏览器需要做如下操作: 首先,下载对应浏览器的驱动,并放在项目下(也可以放在其他地方,写代码的时候路径填写正确即可),如下图所示: 下面就是启动 ...

  6. kafka存储数据量过大,导致磁盘爆满

    问题: 注意到自己负责kafka的某个topic最小的偏移量为0,而最大的偏移量都7亿多了,说明存储在kafka里面的数据没有定时删除,通过登陆到kafka服务器,查看配置文件services.pro ...

  7. 每天一个Linux命令(1)ls命令

    ls是list的缩写,ls命令是Linux系统下最常用的命令之一. ls命令用于打印当前目录的清单,如果指定其它目录,那么就会显示其他目录的文件及文件夹的清单. 通过ls 命令还可以查看文件其它的详细 ...

  8. nodepad++ 标签栏无法拖放标签

    nodepad++ 标签栏无法拖放标签设置--首选项--常用--标签栏--锁定(不允许拖放) 去掉这个勾 ps:最近版本的不知道为什么这个设置不生效了,没找到原因,可能是bug,只能等待升级解决了(升 ...

  9. 解读 Q_D, Q_Q 指针

    见 qglog.h文件定义: #define Q_D(Class) Class##Private * const d = d_func()    #define Q_Q(Class) Class * ...

  10. jQuery 是javascript的一个库(常用插件、处理器)

    jQuery校验官网地址:http://bassistance.de/jquery-plugins/jquery-plugin-validation jQuery就是javascript的一个库,把我 ...