线段树优化建图+dij
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
using namespace std;
#define mp make_pair
#define ll long long
#define mod 1000000007
ll read()
{
ll f=1,x=0;
char c=getchar();
while(c>'9'||c<'0')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return f*x;
}
#define N 100002
int n,m,num,rt1,rt2,Size,head[N*10];
struct ques{
int l1,l2,r1,r2,a,b;
}q[N];
struct edge{
int next,to,vlu;
}mem[N*400];
void add(int u,int v,int vlu)
{
mem[++Size].to=v;mem[Size].next=head[u];head[u]=Size;mem[Size].vlu=vlu;
}
struct node{
int son[2];
}tr[N*10];
ll pow_mod(ll a,ll b)
{
ll as=1;
while(b)
{
if(b&1) as=as*a;
b>>=1;
a=a*a;
}
return as;
}
void build(int &rt,int l,int r,int op)
{
rt=++num;
int mid=l+r>>1;
if(l==r)
{
if(!op) add(l,num,0);
else add(num,l,0);
return ;
}
build(tr[rt].son[0],l,mid,op);
build(tr[rt].son[1],mid+1,r,op);
if(op==0) add(tr[rt].son[0],rt,0),add(tr[rt].son[1],rt,0);
else add(rt,tr[rt].son[0],0),add(rt,tr[rt].son[1],0);
}
vector<int>v1,v2;
void query(int rt,int l,int r,int first,int end,vector<int>* ve)
{
if(first<=l&&r<=end)
{
ve->push_back(rt);
return ;
}
int mid=l+r>>1;
if(first<=mid) query(tr[rt].son[0],l,mid,first,end,ve);
if(end>mid) query(tr[rt].son[1],mid+1,r,first,end,ve);
}
struct DIS{
int id;
ll dis;
bool operator < (const DIS A)const{
return dis>A.dis;
}
};
priority_queue<DIS>Q;
ll dis[N*10],as[N];
bool vis[N*10];
void dij()
{
for(int i=1;i<=num;++i) dis[i]=1e18,vis[i]=0;
dis[1]=0;
Q.push(DIS{1,0});
while(!Q.empty())
{
DIS now=Q.top();
Q.pop();
//cout<<now.id<<'\n';
if(vis[now.id]) continue;
vis[now.id]=1;
for(int i=head[now.id];i;i=mem[i].next)
{
int v=mem[i].to;
if(!vis[v]&&dis[v]>dis[now.id]+mem[i].vlu)
{
dis[v]=dis[now.id]+mem[i].vlu;
Q.push(DIS{v,dis[v]});
}
}
}
for(int i=1;i<=n;++i) as[i]+=dis[i];
}
int main()
{
n=read(),m=read();
for(int i=1;i<=m;++i)
{
q[i].l1=read(),q[i].r1=read(),q[i].l2=read(),q[i].r2=read();
q[i].a=read(),q[i].b=read();
}
num=n;
build(rt1,1,n,0);
build(rt2,1,n,1);
for(int i=1;i<=m;++i)
{
v1.clear();
v2.clear();
query(rt1,1,n,q[i].l1,q[i].r1,&v1);
query(rt2,1,n,q[i].l2,q[i].r2,&v2);
num++;
for(auto v:v1) add(v,num,q[i].a*pow_mod(2,q[i].b));
for(auto v:v2) add(num,v,0);
}
dij();
//cout<<"@@!";
for(int i=1;i<=num;++i) head[i]=0;
num=n;
Size=0;
build(rt1,1,n,0);
build(rt2,1,n,1);
for(int i=1;i<=m;++i)
{
v1.clear();
v2.clear();
query(rt1,1,n,q[i].l2,q[i].r2,&v1);
query(rt2,1,n,q[i].l1,q[i].r1,&v2);
num++;
for(auto v:v1) add(v,num,q[i].a*pow_mod(2,q[i].b));
for(auto v:v2) add(num,v,0);
}
dij();
for(int i=2;i<=n;++i)
{
if(as[i]>=1e18) cout<<-1<<" ";
else cout<<as[i]%mod<<" ";
}
return 0;
}