P4017 最大食物链计数

P4017 最大食物链计数

第一版，20分

#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
typedef long long LL;
 
const int N = 5010, M = 5e5 + 10, mod = 80112002;
 
int h[N], e[M], ne[M], idx = 0;
int n, m;
bool din[N];
bool dout[N];
int f[N];
 
void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}
 
void dfs(int u)
{
    f[u] = 1;
    
    for(int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if(dout[j])
            dfs(j);
        if(!dout[j])
            f[j] = (f[j] + f[u]) % mod;
    }
}
 
int main()
{
    memset(h, -1, sizeof h);
    cin >> n >> m;
    
    int a, b;
    while(m --)
    {
        cin >> a >> b;
        add(b, a);
        din[a] = true;
        dout[b] = true;
    }
    int res = 0;
    for(int i = 1; i <= n; i ++)
    {
        if(!dout[i]) res = i;
        if(!din[i])
            dfs(i);
    }
    cout << f[res] << endl;
    return 0;
}
 

AC版

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

using namespace std;

typedef long long LL;

const int N = 5010, M = 5e5 + 10, mod = 80112002;

int h[N], e[M], ne[M], idx = 0;
int n, m;
bool din[N];
bool dout[N];
int f[N] = {0};
int res = 0;

void add(int a, int b)
{
	e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

int dfs(int u)
{
	if(f[u])	return f[u];
	if(!dout[u]) 	return 1;
	
	
	int num = 0, j = 0;
	for(int i = h[u]; ~i; i = ne[i])
	{
		j = e[i];
		num = (num + dfs(j)) % mod;	
	}
	f[u] = num;
	return f[u];
}

int main()
{
	memset(h, -1, sizeof h);
	cin >> n >> m;
	
	int a, b;
	while(m --)
	{
		cin >> a >> b;
		add(b, a);
		din[a] = true;
		dout[b] = true;
	}
	
	for(int i = 1; i <= n; i ++)
	{
		if(!din[i])
			res = (res + dfs(i)) % mod;
	}
	cout << res << endl;
	return 0;
}