POJ 1258 Agri-Net(最小生成树) && POJ 2377 Bad Cowtractors(最大生成树)

这是一个模版题,我也只是为了记录一下我中饭时手打的模版.

/*  xzppp  */
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
const int MAXN = 10000+17;
const int MAXM = 20;
const int MAXV = 100+17;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
vector G[MAXV];
bool vis[MAXV];
int minc[MAXV];
int prim()
{
    for (int i = 0; i < MAXV; ++i)
    {
        minc[i] = INF;
        vis[i] = 0;
    }
    int res = 0;
    priority_queuevector ,greater > q;
    q.push(MP(0,0));
    while(!q.empty())
    {
        int v = q.top().second;
        int temp = q.top().first;
        q.pop();
        if(vis[v]) continue;
        vis[v] = 1;
        res += temp;
        for (int i = 0; i < G[v].size(); ++i)
        {
            int d = G[v][i].first,to = G[v][i].second;
            if(!vis[to]&&minc[to]>d)
            {
                q.push(MP(d,to));
                minc[to] = d;
            }
        }
    }
    return  res;
}
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int n;
    while(cin>>n)
    {       
        for (int i = 0; i < n; ++i)
        {
            G[i].clear();
            for (int j = 0; j < n; ++j)
            {
                int temp;
                scanf("%d",&temp);
                if(i==j) continue;
                G[i].PB(MP(temp,j));
            }
        }
        int ans = prim();
        cout<return 0;
}

模版双雄.一开始看到最大生成树我还有点怕..

/*  xzppp  */
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
const int MAXN = 10000+17;
const int MAXM = 20;
const int MAXV = 1001+17;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
vector G[MAXV];
bool vis[MAXV];
int minc[MAXV];
int prim(int nv)
{
    for (int i = 0; i < MAXV; ++i)
    {
        minc[i] = -1;
        vis[i] = 0;
    }
    int res = 0;
    priority_queue q;
    q.push(MP(0,0));
    while(!q.empty())
    {
        int v = q.top().second;
        int temp = q.top().first;
        q.pop();
        if(vis[v]) continue;
        vis[v] = 1;
        res += temp;
        for (int i = 0; i < G[v].size(); ++i)
        {
            int d = G[v][i].first,to = G[v][i].second;
            if(!vis[to]&&minc[to]bool can = true;
    for (int i = 0; i < nv; ++i)
        if(vis[i]==0) can = false;
    if(!can) res = -1;
    return  res;
}
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int n,m,mx= 0 ;
    cin>>n>>m;
    for (int i = 0; i < m; ++i)
    {
        int u,v,cost;
        scanf("%d%d%d",&u,&v,&cost);
        u--;v--;
        G[u].PB(MP(cost,v));
        G[v].PB(MP(cost,u));
        mx = max(mx,max(u,v));
    }
    int ans = prim(n);
    cout<return 0;
}