题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2647
题意:boss需要发工资,每个人的最低工资为888,在给定的条件下,求boss需要发的最少工资和。
m个条件:每次为u
和v
,代表u
的工资高于v
的工资。若出现矛盾,则输出-1
。
思路:几乎为裸的拓扑排序,在节点入队时记录该节点在拓扑序中所并列排的名次。
代码:
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
const int N = 1e4 + 10;
typedef pair<int, int> P;
vector<int> g[N];
int in[N];
int n, m;
long long topologysort() {
long long sum = 0;
long long salary = 888;
int out = n;
queue<P> q;
for (int i = 1; i <= n; i++) {
if (in[i] == 0)
q.push(make_pair(i, 0));
}
while (!q.empty()) {
P f = q.front();
q.pop();
out--;
sum = sum + salary + f.second;
for (int i = 0; i < g[f.first].size(); i++) {
int v = g[f.first][i];
in[v]--;
if (in[v] == 0)
q.push(make_pair(v, f.second + 1));
}
}
if (out != 0)
return -1;
return sum;
}
int main() {
while (scanf("%d%d", &n, &m) != EOF) {
for (int i = 0; i < N; i++)
g[i].clear();
memset(in, 0, sizeof(in));
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d%d", &u, &v);
g[v].push_back(u);
in[u]++;
}
long long res = topologysort();
printf("%I64d\n", res);
}
return 0;
}