【DG2017特长生】工程

题目描述

给出一个图，有些点在被操作前都要将连接其的点都操作一遍，每个点有操作代价（满足入度为零的点可以同时操作），现在问把所有点都操作完的最小代价是多少

样例输入 #1

5
5 4 12 7 2
0 0 0 0
0 0 0 0
0 0 0 0
1 1 0 0
1 1 1 1

样例输出 #1

14

样例输入 #2

5
5 4 12 7 2
0 1 0 0
0 0 0 0
0 0 1 0
1 1 0 0
1 1 1 1

样例输出 #2

-1

思路

拓扑排序，然后直接模拟

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

int t, n, ans = -1e9, b;
int day[505], a[505], w[505][505], in[505], h[505], ini[505], p[505][505], tt[505];

struct node
{
	int to, next;
}g[100005];

void add(int x, int y)
{
	g[++t] = (node){x, h[y]}; h[y] = t;
}

void work(int x)
{
	for(int i = h[x]; i; i = g[i].next)
	{
		int to = g[i].to;
		in[to]--;
		p[to][++tt[to]] = day[x];
		if(in[to] == 0) {
			for(int j = 1; j <= tt[to]; ++j)
				day[to] = max(day[to], p[to][j]);
			day[to] += a[to];
		}
	}
}

int main()
{
	freopen("project.in", "r", stdin);
	freopen("project.out", "w", stdout);
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	for(int i = 1; i <= n; ++i)
	for(int j = 1; j <= n; ++j)
	{
		if(i == j) ++j;
		if(j > n) break;
		scanf("%d", &w[i][j]);
		if(w[i][j] == 1) add(i, j), in[i]++;
 	}
 	for(int i = 1; i <= n; ++i)
 		if(in[i] == 0) day[i] = a[i];
	int num = 0;
	while(num <= 5)
	{
		for(int i = 1; i <= n; ++i) ini[i] = in[i];
		for(int i = 1; i <= n; ++i) {
			if(in[i] == 0) work(i), num++;
		}
		for(int i = 1; i <= n; ++i)
			if(ini[i] == in[i] && ini[i] != 0) {
				printf("-1\n");
				b = 1;
				break;
			}
		if(b) break;
	}
	if(!b) {
		for(int i = 1; i <= n; ++i)
			if(day[i] != day[0]) ans = max(ans, day[i]);
		printf("%d\n", ans);
	}
	return 0;
	fclose(stdin);
	fclose(stdout); 
}