题意:
就是已经知道某个人得工资要大于另外一个人的工资,且每个人的基础工资为888,求发给所有人工资的总和最小。
解题思路:
利用逆拓扑排序,且得到一个入度为零的点时,他的工资是所有通往他的点的钱的最大值。
注意:
无
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <map>
using namespace std;
#define MAXN0 10011
typedef long long LL;
queue<int>q;
vector<int>G[MAXN0];
map<int,int>mp;
map<int,int>::iterator itr;
int nowm[MAXN0],ct[MAXN0],n,m,arr[MAXN0],arrcnt,num;
int max(int aa,int bb){
return aa>bb?aa:bb;
}
void init(){
arrcnt = 0;
memset(nowm,0,sizeof(nowm));
memset(ct,0,sizeof(ct));
}
int getnum(int s){
int tmp0;
itr = mp.find(s);
if(itr==mp.end()){
tmp0 = num;
arr[arrcnt++] = tmp0;
mp.insert(pair<int,int>(s,num++));
}
else {
tmp0 = (*itr).second;
}
return tmp0;
}
LL topsort(){
LL ans = 0;
for(int i=1;i<=n;++i){
nowm[i] = 888;
}
for(int i=0;i<arrcnt;++i){
if(!ct[arr[i]]){
// nowm[arr[i]] = 888
q.push(arr[i]);
}
//nowm[arr[i]] = 888;
}
int tmp0,tmp1,tmp2;
while(!q.empty()){
tmp0 = q.front();
q.pop();
tmp1= (int)G[tmp0].size();
for(int i=0;i<tmp1;++i){
tmp2 = G[tmp0][i];
--ct[tmp2];
//只加一次
nowm[tmp2] = max(nowm[tmp2],nowm[tmp0]+1);
if(!ct[tmp2]){
q.push(tmp2);
}
}
}
for(int i=1;i<=n;++i){
if(ct[i])
return -1;
ans+=nowm[i];
}
return ans;
}
void solve(){
LL ans = topsort();
printf("%lld\n",ans);
}
void clear(){
if(mp.size())
mp.clear();
for(int i=0;i<arrcnt;++i){
if(G[arr[i]].size()){
G[arr[i]].clear();
}
}
}
int main(){
int u,v;
while(scanf("%d%d",&n,&m)!=EOF){
init();
num = 1;
int tmp0,tmp1,sz;
bool flag = false;
for(int i=0;i<m;++i){
flag = false;
scanf("%d%d",&u,&v);
tmp0 = getnum(u);
tmp1 = getnum(v);
sz = (int)G[tmp1].size();
for(int i=0;i<sz;++i){
if(G[tmp1][i]==tmp0){
flag = true;
break;
}
}
if(!flag){
++ct[tmp0];
G[tmp1].push_back(tmp0);
}
}
solve();
clear();
}
return 0;
}