Codeforces Round #374 (Div. 2) C. Journey(dfs+dp)
来源:互联网 发布:软件测试基本理论 编辑:程序博客网 时间:2024/05/11 16:10
dp[i][j]表示走到i点且经过j个点所需的最短时间。
状态转移方程:
dp[i][j] = min(dp[i][j], dp[k][j-1]+dis[k][i])
代码:
#include<bits/stdc++.h>using namespace std;const int maxn = 5005;int dp[maxn][maxn], pre[maxn][maxn], head[maxn], k, n, m, t;struct node{ int v, w, next;}edge[maxn];void addEdge(int u, int v, int w){ edge[k].v = v; edge[k].w = w; edge[k].next = head[u]; head[u] = k++;}void dfs(int u, int setp){ for(int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; int w = edge[i].w; int dis = dp[u][setp]+w; if(dis < dp[v][setp+1] && dis <= t) { dp[v][setp+1] = dis; pre[v][setp+1] = u; dfs(v, setp+1); } }}void print(int cur, int setp){ stack<int> s; while(cur) { s.push(cur); cur = pre[cur][setp--]; } printf("1"); s.pop(); while(!s.empty()) printf(" %d", s.top()), s.pop(); printf("\n");}int main(void){ while(~scanf("%d%d%d", &n, &m, &t)) { k = 0; memset(head, -1, sizeof(head)); memset(dp, 63, sizeof(dp)); memset(pre, 0, sizeof(pre)); while(m--) { int u, v, w; scanf("%d%d%d", &u, &v, &w); addEdge(u, v, w); } dp[1][1] = 0; dfs(1, 1); for(int i = n; i >= 1; i--) if(dp[n][i] <= t) { printf("%d\n", i); print(n, i); break; } } return 0;}
Recently Irina arrived to one of the most famous cities of Berland — the Berlatov city. There are n showplaces in the city, numbered from 1to 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 exceedingT. 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 131 2 52 3 72 4 8
31 2 4
6 6 71 2 21 3 33 6 32 4 24 6 26 5 1
41 2 4 6
5 5 61 3 33 5 31 2 22 4 34 5 2
31 3 5
- Codeforces Round #374 (Div. 2) C. Journey(dfs+dp)
- Codeforces Round #374 (Div. 2) -- C. Journey (DP)
- Codeforces Round #374 (Div. 2) C. Journey dp
- Codeforces Round #374 (Div. 2) C. Journey DP
- Codeforces Round #374 (Div. 2) C. Journey 拓扑排序+dp
- Codeforces Round #374 (Div. 2) C. Journey —— DP
- Codeforces Round #374 (Div. 2) C. Journey
- Codeforces Round #374 (Div. 2) C. Journey
- Codeforces Round #374 (Div. 2)C. Journey
- Codeforces Round #374 (Div. 2)-C. Journey
- Codeforces Round #428 (Div. 2) C. Journey(dfs deep
- Codeforces Round #428 (Div. 2) C. Journey(dfs)
- CodeForces Round#374 C:Journey(dfs图论+dp)
- Codeforces Round #374 (Div. 2) 721C Journey DAG上DP
- Codeforces #428 (Div. 2) C. Journey (DFS
- Codeforces Round #374 (Div. 2) C. Journey DPor最短路
- Codeforces Round #428 (Div. 2) C.Journey(dfs求期望)
- C. Journey(dfs求期望+Codeforces Round #428 (Div. 2))
- 正则表达式
- 李群、李代数在计算机视觉中的应用
- php文件删除unlink()详解
- 迷宫寻路算法-js-深度优先搜索
- 集合
- Codeforces Round #374 (Div. 2) C. Journey(dfs+dp)
- 快速傅里叶变换(FFT)(上)
- Java常见排序:(三)快速排序
- HDU 1251 统计难题 字典树
- Maven的介绍与安装步骤
- java容器
- nginx负载均衡配置实例详解
- 消息推送
- git常用命令