hdu4725 The Shortest Path in Nya Graph

首先感谢prey大爷提供的脑洞和特殊的dijkstra姿势

题意就不说了..主要注意题目有问题,输入的是m条边,愣是写的n条边[还想为什么有个输入的值完全没用到呢....

在这里放上prey帮调题的时候写的数据生成器

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100233;
int perm[maxn];
vector<int> G[maxn];
int main(int argc, char ** argv)
{
    assert(argc == 5);
    int n = atoi(argv[1]), m = atoi(argv[2]),
        lim = atoi(argv[3]), c = atoi(argv[4]),  seed;
    FILE *rnd = fopen("/dev/urandom", "r");
    fread(&seed, 4, 1, rnd); fclose(rnd); 
    mt19937 RAND(seed);
       printf("1
%d %d %d
", n, m, c);
    for(int i = 1; i <= n; i++)
        printf("%d ", int(RAND()%(n) + 1));
    printf("
"); 
    set<pair<int, int> > S;
    for(int i = 1; i <= m; i++)
    {
        int u, v;
        do u = int(RAND() % n + 1), v =  int(RAND() % n + 1);
        while (u == v || S.count(make_pair(u, v)) || S.count(make_pair(v, u)));
        S.insert(make_pair(u, v));
        printf("%d %d %d
", u, v, int(RAND()%lim));
    }
}

首先编译数据生成器（gen.cpp）

g++ gen.cpp -std=c++11 -o gen

再编译ac程序 

g++ acc.cpp -o acc

从in里读取输入文件

./acc <in

然后编译自己的程序

g++ 2.cpp -o waa

./waa <in

最后执行这句话 前面的数字代表给数据生成器提供的参数,这里代表的事n,m,mod,c

while ./gen 100000 100000 1000 2333 > in && ./acc < in > ac && ./waa < in > wa && diff -w ac wa;do echo OK;done

最后放上拥有特殊姿势的dijkstra

#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#define maxn 300010
#define maxm 600010
#define INF 200000000
#include <algorithm>
using namespace std;
vector <unsigned > fr[maxn];
struct dij{
    unsigned d, u; dij() {}
    inline bool operator<(const dij& other) const { return d > other.d; }
    inline dij(unsigned _d, unsigned _u) : d(_d), u(_u) {} 
};
struct heap
{
    unsigned  size;
    dij data[maxm];
    inline void push(dij x) { data[size++] = x; push_heap(data, data + size); }
    inline dij top()  { return *data; }
    inline void pop() { pop_heap(data, data + size--); }
}Q;
struct ed{
    unsigned u, v, w, next;
}a[maxm];
unsigned n, m, c, tot;
unsigned be[maxn], first[maxn], done[maxn];
unsigned dis[maxn];
void addedge(unsigned st, unsigned end, unsigned val)
{
    a[++tot].u = st;a[tot].v = end;a[tot].w = val;
    a[tot].next =first[st];first[st] = tot;
}
inline void DIJKSTRA()
{
    for(unsigned i = 1; i <=3*n; i++)dis[i] = INF, done[i] = 0;
    Q.push(dij(dis[1] = 0, 1));
    while (Q.size)
    {
        unsigned u = Q.top().u; Q.pop();
        if(done[u])continue;
        done[u] = 1;
        for(unsigned e = first[u]; e; e = a[e].next)
        {
            unsigned v = a[e].v;
            if(dis[u] + a[e].w < dis[v])
            {
                dis[v] = dis[u] + a[e].w;    
                Q.push(dij(dis[v], v));
            }
        }
    }

}
template<class T> inline void maxt(T& A, T b) { if (A < b) A = b; }
//template<class T> inline bool mint(T& a, T b) { return a > b ? a = b, true : false; }
template<class T> inline void mint(T& A, T b) { if (A > b) A = b; }
//if (mint(dist[v], dist[u] + e[ee].w) && !inq[v])
//    inq[que[qt++] = v] = true; prwang两行spfa
int main()
{
    unsigned T, x, y, z;
    scanf("%u", &T);
    for(unsigned t = 1; t <= T; t++)    
    {
        memset(first, 0, sizeof(first));
        memset(a, 0, sizeof(a));
        memset(be, 0, sizeof(be));
        tot = 0;
        scanf("%u %u %u", &n, &m, &c);
        for(unsigned i = 1; i <= n; i++)fr[i].clear();
        unsigned  lmin = n, lmax = 1;
        for(unsigned i = 1; i <= n; i++)
        {
            scanf("%u ", &be[i]);
            fr[be[i]].push_back(i);
            maxt(lmax, be[i]), mint(lmin, be[i]);
        }
        for(unsigned i = 1; i <= m; i++)
        {
            scanf("%u %u %u", &x, &y, &z);
            addedge(x, y, z);addedge(y, x, z);
        }
        unsigned cc = n + 1;
        for (unsigned i = lmin, j = i + 1; i < lmax; i = j++)
        {
            while (!fr[j].size())  ++j;
            if (j - i > 1) continue;
            for(unsigned k = 0; k < (unsigned)fr[i].size(); k++)
                addedge(fr[i][k], cc, 0);
            for(unsigned k = 0; k < (unsigned)fr[j].size(); k++)
                addedge(cc, fr[j][k], c*(j-i));
            cc++;
            for(unsigned k = 0; k < (unsigned)fr[i].size(); k++)
                addedge(cc, fr[i][k], 0);
            for(unsigned k = 0; k < (unsigned)fr[j].size(); k++)
                addedge(fr[j][k], cc, c*(j-i));
            cc++;
        }
        DIJKSTRA();
        if(dis[n] == INF)
            printf("Case #%u: -1
", t);
        else 
        printf("Case #%u: %u
", t, dis[n]);
    }
}