TOJ 2609 Revamping Trails -- dp

最新推荐文章于 2017-09-20 10:37:01 发布

randygx

最新推荐文章于 2017-09-20 10:37:01 发布

阅读量536

点赞数

分类专栏： ACM 文章标签： dijkstra dp heap

本文链接：https://blog.csdn.net/randygx/article/details/25981065

版权

ACM 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

题目：http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=2609

分析：用dp[i][j]表示到结点i用了j次免费名额，那么dp[i][j] = min(dp[t][j - 1], dp[t][j] + cost[t][j])，其中(t, i)之间有边。一种做法就是像下面代码中的那样分k次调用dij，每次都固定k。另一种做法是只调用一次dij，在考察结点t时，考虑t的每一个邻接点i，考虑t与i之间用免费名额与不用两种情况，也就是说对于每一条边(t, i)，当考察(t, i)时，可能向队列中加入两个元素。但是这题比较卡时间，用后面这种做法会TLE。

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
         #include 
         #include 
         
           #include 
          
            #include 
           
             #include 
            
              #include 
             
               #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #include 
                  
                    #define mp make_pair #define X first #define Y second #define MEMSET(a, b) memset(a, b, sizeof(a)) using namespace std; typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef pair 
                   
                     pii; typedef vector 
                    
                      vi; typedef vi::iterator vi_it; typedef map 
                     
                       mii; typedef priority_queue 
                      
                        pqp; typedef priority_queue 
                       
                         , greater 
                        
                          > rpqp; typedef pair 
                         
                           plli; typedef priority_queue 
                          
                            , greater 
                           
                             > pq; const int MAX_N = 10000 + 2; const int MAX_M = 50000 + 2; const int MAX_K = 20 + 2; const ll INF = (ll)1.0e15; int cnt = 1; int head[MAX_N]; bool vis[MAX_N]; ll dis[MAX_N][MAX_K]; int level[MAX_N]; struct edge { int v; int t; int next; } eg[MAX_M << 1]; struct node { int v; ll cost; node() { } node(int _v, const ll &_cost) : v(_v), cost(_cost) { } bool operator < (const node &nd) const { return cost > nd.cost; } }; void add_edge(int u, int v, int w) { eg[cnt].v = v; eg[cnt].t = w; eg[cnt].next = head[u]; head[u] = cnt++; eg[cnt].v = u; eg[cnt].t = w; eg[cnt].next = head[v]; head[v] = cnt++; } ll dij(int src, int des, int k) { priority_queue 
                            
                              q; dis[src][k] = 0; MEMSET(vis, 0); q.push(node(src, 0)); if (!k) { while (!q.empty()) { node tmp = q.top(); q.pop(); int u = tmp.v; if (vis[u]) { continue; } vis[u] = true; for (int i = head[u]; i; i = eg[i].next) { int v = eg[i].v; if (!vis[v] && dis[u][0] + eg[i].t < dis[v][0]) { dis[v][0] = dis[u][0] + eg[i].t; q.push(node(v, dis[v][0])); } } } } else { while (!q.empty()) { node tmp = q.top(); q.pop(); int u = tmp.v; if (vis[u]) { continue; } vis[u] = true; for (int i = head[u]; i; i = eg[i].next) { int v = eg[i].v; ll tt = min(dis[u][k - 1], dis[u][k] + eg[i].t); if (!vis[v] && tt < dis[v][k]) { dis[v][k] = tt; q.push(node(v, tt)); } } } } } int main(int argc, char *argv[]) { // freopen("D:\\in.txt", "r", stdin); int n, m, k, i, j; cin >> n >> m >> k; while (m--) { int a, b, c; scanf("%d%d%d", &a, &b, &c); add_edge(a, b, c); } for (i = 1; i <= n; ++i) { for (j = 0; j <= k; ++j) { dis[i][j] = INF; } } for (i = 0; i <= k; ++i) { dij(1, n, i); } printf("%I64d\n", dis[n][k]); return 0; }