Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1 to n, and some of them are connected by one-directional roads. The roads in Berlatov are designed in a way such that there are no cyclic routes between showplaces.
Initially Irina stands at the showplace 1, and the endpoint of her journey is the showplace n. Naturally, Irina wants to visit as much showplaces as she can during her journey. However, Irina's stay in Berlatov is limited and she can't be there for more than T time units.
Help Irina determine how many showplaces she may visit during her journey from showplace 1 to showplace n within a time not exceeding T. It is guaranteed that there is at least one route from showplace 1 to showplace n such that Irina will spend no more than T time units passing it.
The first line of the input contains three integers n, m and T (2 ≤ n ≤ 5000, 1 ≤ m ≤ 5000, 1 ≤ T ≤ 109) — the number of showplaces, the number of roads between them and the time of Irina's stay in Berlatov respectively.
The next m lines describes roads in Berlatov. i-th of them contains 3 integers ui, vi, ti (1 ≤ ui, vi ≤ n, ui ≠ vi, 1 ≤ ti ≤ 109), meaning that there is a road starting from showplace ui and leading to showplace vi, and Irina spends ti time units to pass it. It is guaranteed that the roads do not form cyclic routes.
It is guaranteed, that there is at most one road between each pair of showplaces.
Print the single integer k (2 ≤ k ≤ n) — the maximum number of showplaces that Irina can visit during her journey from showplace 1 to showplace n within time not exceeding T, in the first line.
Print k distinct integers in the second line — indices of showplaces that Irina will visit on her route, in the order of encountering them.
If there are multiple answers, print any of them.
4 3 13 1 2 5 2 3 7 2 4 8
3 1 2 4
6 6 7 1 2 2 1 3 3 3 6 3 2 4 2 4 6 2 6 5 1
4 1 2 4 6
5 5 6 1 3 3 3 5 3 1 2 2 2 4 3 4 5 2
3 1 3 5
求经过最多点花费时间小于T 从1到达n。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#pragma comment (linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-6
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FRE(i,a,b) for(i = a; i <= b; i++)
#define FREE(i,a,b) for(i = a; i >= b; i--)
#define FRL(i,a,b) for(i = a; i < b; i++)
#define FRLL(i,a,b) for(i = a; i > b; i--)
#define mem(t, v) memset ((t) , v, sizeof(t))
#define sf(n) scanf("%d", &n)
#define sff(a,b) scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pf printf
#define DBG pf("Hi\n")
typedef long long ll;
using namespace std;
#define INF 0x3f3f3f3f
#define mod 1000000009
const int MAXN=5005;
int dp[MAXN][MAXN]; //经过i个点到达j的最小花费。
int vis[MAXN][MAXN]; //经过i个点到达j的上一个点。
int head[MAXN*2];
int cnt,n,m,T;
struct node
{
int u,v,w,nxet;
} edge[MAXN*2];
void init()
{
memset(head,-1,sizeof(head));
cnt=0;
}
void add(int u,int v,int w)
{
edge[cnt].u=u;
edge[cnt].v=v;
edge[cnt].w=w;
edge[cnt].nxet=head[u];
head[u]=cnt++;
}
void DP()
{
int i,j;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
dp[i][j]=T+10;
dp[1][1]=0;
for(i=2; i<=n; i++)
{
for(j=0; j<m; j++)
{
int from=edge[j].u,to=edge[j].v,cost=edge[j].w;
if(dp[i-1][from]+cost<dp[i][to])
{
dp[i][to]=dp[i-1][from]+cost;
vis[i][to]=from;
}
}
}
for(i=n; i>=1; i--)
if(dp[i][n]<=T)
break;
printf("%d\n",i);
int pos=n;
vector<int>ans;
ans.clear();
ans.push_back(pos);
for(int x=i; x>1; x--)
{
ans.push_back(vis[x][pos]);
pos=vis[x][pos];
}
for(int sz=ans.size()-1; sz>=0; sz--)
cout<<ans[sz]<<" ";
cout<<endl;
}
int main()
{
while(cin>>n>>m>>T)
{
int u,v,w;
init();
for(int i=1; i<=m; i++)
{
cin>>u>>v>>w;
add(u,v,w);
}
DP();
}
return 0;
}