hdu 5385 The path 构造

题意：给出一张有向图（尼玛是有向图啊！），只给出边的起点终点，然后要确定边长，来构造出单源最短路中起点为1的距离d（x）且满足下式， d(1)<d(2)<....d(x)>d(x+1)>...d(n) .

按照题解说的模拟构造就行了- -如下：

我们可以采取贪心做法，一开始将1号点作为最短路径树的根，然后左边从2开始，右边从$n$开始，只要之前加入的点有边连向他们就加入

这样一个点加入的时间就是他的$s$值，最短路径树上的父亲也可以确定，于是输出时非树边长度为n，树边长度为两个端点dis之差

//#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef pair <int, int> pl;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 100010;

struct node{
    int v, nxt, id;
}e[N<<1];

struct E{
    int u, v;
}A[N];

int head[N];
int n, m, cnt;
int ans[N], dis[N];
bool vis[N];

void init()
{
    cnt = 0;
    memset( head, -1, sizeof( head ) );
    memset( vis, 0, sizeof( vis ) );
    memset( ans, 0, sizeof( ans ) );
}

void add( int u, int v, int id )
{
    e[cnt].v = v;
    e[cnt].id = id;
    e[cnt].nxt = head[u];
    head[u] = cnt++;
}

int main()
{
    int tot;
    for( scanf("%d", &tot); tot--; ) {
        scanf("%d%d", &n, &m);
        init();
        for( int i = 1, u, v; i <= m; ++i ) {
            scanf("%d%d", &u, &v);
            add( u, v, i );
            A[i].u = u, A[i].v = v;
        }
        int l = 1, r = n, t = 0;
        vis[l] = 1;
        while( l <= r ) {
            if( vis[l] ) {
                dis[l] = ++t;
                for( int i = head[l]; ~i; i = e[i].nxt ) {
                    int v = e[i].v;
                    if( !vis[v] ) {
                        vis[v] = 1;
                        ans[e[i].id] = 1;
                    }
                }
                l++;
            }
            if( vis[r] ) {
                dis[r] = ++t;
                for( int i = head[r]; ~i; i = e[i].nxt ) {
                    int v = e[i].v;
                    if( !vis[v] ) {
                        vis[v] = 1;
                        ans[e[i].id] = 1;
                    }
                }
                r--;
            }
        }
        for( int i = 1; i <= m; ++i ) {
            if( ans[i] )
                printf("%d\n", abs( dis[A[i].u] - dis[A[i].v] ) );
            else
                printf("%d\n", n);
        }
    }
    return 0;
}