hdu 6071 Lazy Running 最短路建模

Lazy Running

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)

Problem Description

In HDU, you have to run along the campus for 24 times, or you will fail in PE. According to the rule, you must keep your speed, and your running distance should not be less than K meters.

There are 4 checkpoints in the campus, indexed as p1,p2,p3 and p4. Every time you pass a checkpoint, you should swipe your card, then the distance between this checkpoint and the last checkpoint you passed will be added to your total distance.

The system regards these 4 checkpoints as a circle. When you are at checkpoint pi, you can just run to pi−1 or pi+1(p1 is also next to p4). You can run more distance between two adjacent checkpoints, but only the distance saved at the system will be counted.

Checkpoint p2 is the nearest to the dormitory, Little Q always starts and ends running at this checkpoint. Please write a program to help Little Q find the shortest path whose total distance is not less than K.

 

Input

The first line of the input contains an integer T(1≤T≤15), denoting the number of test cases.

In each test case, there are 5 integers K,d1,2,d2,3,d3,4,d4,1(1≤K≤1018,1≤d≤30000), denoting the required distance and the distance between every two adjacent checkpoints.

 

Output

For each test case, print a single line containing an integer, denoting the minimum distance.

 

Sample Input

1
2000 600 650 535 380

 

Sample Output

2165

Hint

The best path is 2-1-4-3-2.

 

Source

2017 Multi-University Training Contest - Team 4

官方题解：

友情链接：https://post.icpc-camp.org/d/674-poi-x-sums

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<bitset>
#include<time.h>
using namespace std;
#define LL long long
#define pi (4*atan(1.0))
#define eps 1e-4
#define bug(x)  cout<<"bug"<<x<<endl;
const int N=6e4+,M=1e6+,inf=1e9+,MOD=1e9+;
const LL INF=1e18+,mod=1e9+;

struct mmp
{
    int s;
    LL dis;
    bool operator <(const  mmp &b)const
    {
        return dis>b.dis;
    }
};
LL ans[][N];
int vis[][N];
priority_queue<mmp>q;
vector<pair<int,int> >edge[];
void dij(int s,int m)
{
    ans[s][]=;
    q.push((mmp){s,0LL});
    while(!q.empty())
    {
        mmp now = q.top();
        q.pop();
        if(vis[now.s][now.dis%m])continue;
        vis[now.s][now.dis%m]=;
        for(int i = ; i <  ; i++)
        {
            int v=edge[now.s][i].first;
            int w=edge[now.s][i].second;
            int z=(now.dis+w)%m;
            if(ans[v][z]==-||ans[v][z] >=now.dis + w)
            {
                q.push((mmp){v,now.dis+w});
                ans[v][z]=now.dis+w;
            }
        }
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(ans,-,sizeof(ans));
        memset(vis,,sizeof(vis));
        LL x;
        int d1,d2,d3,d4;
        scanf("%lld%d%d%d%d",&x,&d1,&d2,&d3,&d4);
        for(int i=;i<=;i++)
        edge[i].clear();
        edge[].push_back(make_pair(,d1));
        edge[].push_back(make_pair(,d4));
        edge[].push_back(make_pair(,d1));
        edge[].push_back(make_pair(,d2));
        edge[].push_back(make_pair(,d3));
        edge[].push_back(make_pair(,d2));
        edge[].push_back(make_pair(,d3));
        edge[].push_back(make_pair(,d4));
        dij(,*d1);
        LL out=INF;
        d1*=;
        for(int i=;i<d1;i++)
        {
            if(ans[][i]==-)continue;
            if(ans[][i]>=x)out=min(out,ans[][i]);
            else
            {
                LL z=x-ans[][i];
                LL zz=ans[][i]+(z%d1?(z/d1+)*d1:z);
                out=min(out,zz);
            }
        }
        printf("%lld\n",out);
    }
    return ;
}