题意:给出一个有向有环图,第i个点距离1号点的最短路距离记为d(i),要求给每条边赋值, 使得 d(1)<d(2)< ......<d(x)>d(x+1)>.....d(n)。
思路:贪心。对于一个图,如果我们知道每个点的d值,那么我们可以根据d值来给边赋值。
现在的问题是求每个点的d值,可以默认每个点的d是1到n-1不等,用一个集合保存当前可到达的点的集合,然后用两个指针从左和右向中间扫,给每个点赋一个d值,然后遍历所有边给边赋值即可。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int MAXN = 100100;
//const int INF = 0x3f3f3f3f;
struct Edge {
int from, to, next;
} edge[MAXN*2];
int head[MAXN], tot;
int n, m, dis[MAXN];
set<int> s;
void addedge(int u, int v) {
edge[tot].from = u;
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
void init() {
memset(head, -1, sizeof(head));
tot = 0;
}
void work() {
s.clear();
for(int i = head[1]; i != -1; i = edge[i].next) s.insert(edge[i].to);
int cnt = 1, left = 2, right = n;
dis[1] = 0;
while(cnt < n) {
int t;
if(s.count(left)) t = left++;
else t = right--;
dis[t] = cnt++;
for(int i = head[t]; i != -1; i = edge[i].next) s.insert(edge[i].to);
}
}
int main() {
//freopen("input.txt", "r", stdin);
int T; cin >> T;
while(T--) {
init();
cin >> n >> m;
for(int i = 1, u, v; i <= m; i++) {
scanf("%d%d", &u, &v);
addedge(u, v);
}
work();
for(int i = 0; i < m; i++) {
int u = edge[i].from, v = edge[i].to;
if(u == v) printf("%d\n", n);
else printf("%d\n", abs(dis[u]-dis[v]));
}
}
return 0;
}