果然我还是太蒟蒻了(哭
最后两个点死活过不去
如果有大佬能指正,感激不尽~
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define For(i,m,n) for(register int i=m;i<n;i++)
#define rFor(i,m,n) for(register int i=m;i>n;i--)
#define r(a) read(a)
#define rr(a,b) read(a),read(b)
#define rrr(a,b,c) read(a),read(b),read(c)
using namespace std;
typedef long long ll;
typedef unsigned long long Ull;
template <class T>
inline void read(T &x)
{
x=0;
T f=1;
char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
x=x*f;
}
const int MaxN = 550, MaxM = 1e6;
const double DOUBLE_INF=1e20;
struct edge{
int next;
int from;
int to;
int dis;
}e[MaxM];
int head[MaxN];
int res[MaxN];
int tot=0;
struct state{
int times;
int u;
vector<int> A;
};
unordered_map<int,state > mp;//node,node_num
int n,m,t,k;
queue<state> Q;
void add_edge(int from,int to,int dis)
{
tot++;
e[tot].from=from;
e[tot].next=head[from];
e[tot].to=to;
e[tot].dis=dis;
head[from]=tot;
}
void inline getInput(int &cnt,int &ai,int &bi,int &ci)
{
int tmpIn[3];
string in;
getline(cin,in);
istringstream iss(in);
while(iss>>tmpIn[cnt++]);
if(cnt==4) ai=tmpIn[0],bi=tmpIn[1],ci=tmpIn[2];
else ai=tmpIn[0],bi=tmpIn[1];
}
void inline bfs1(int nowt)
{
while(Q.size()){
state now=Q.front();
if(now.times+t>nowt) break;
// mp[now.u]=now;
Q.pop();
for(int i=head[now.u];i;i=e[i].next){
int v=e[i].to;
state nxt=mp[v];
// cout<<'\n';
// For(i,0,nxt.A.size()) cout<<nxt.A[i]<<' ';
// cout<<'\n';
if(now.A.size()<nxt.A.size()) continue;
if(now.A.size()==nxt.A.size()){
if(now.A[now.A.size()-1]>=nxt.A[nxt.A.size()-1]) continue;
}
nxt.A=now.A;
nxt.times=now.times;
nxt.times+=t;
if(nxt.times<=nowt) mp[v]=nxt;
// cout<<'\n';
// For(i,0,nxt.A.size()) cout<<nxt.A[i]<<' ';
// cout<<'\n';
Q.push(nxt);
}
}
}
void input()
{
rr(n,m);
vector<int> tmp;tmp.push_back(0);
For(i,1,n+1) mp[i]=(state{0,i,tmp});
vector<pair<int,int> > Q_tmp_input;
For(i,0,m){
int u,v;
rr(u,v);
Q_tmp_input.push_back(make_pair(u,v));
}
rr(t,k);
For(i,0,m){
int u,v;
u=Q_tmp_input[i].first;
v=Q_tmp_input[i].second;
add_edge(u,v,t);
add_edge(v,u,t);
}
For(i,0,k){
int ai,bi,ci,cnt=0;
getInput(cnt,ai,bi,ci);
if(cnt==4){
bfs1(bi);
mp[ai].A.push_back(ci);
mp[ai].times=bi;
Q.push(mp[ai]);
}
else{
bfs1(bi);
mp[ai].times=bi;
cout<<mp[ai].A.size()<<' ';
For(i,0,mp[ai].A.size()) cout<<mp[ai].A[i]<<' ';
cout<<'\n';
}
}
}
int main()
{
input();
return 0;
}