NEUQ-ACM预备队必做题——第十周

洛谷P1525 [NOIP2010 提高组] 关押罪犯

代码：

#include <cstdio>
#include <algorithm>
using namespace std;
struct data {int x,y,z;};//结构体便于排序的变换
data f[100005];
int n,m,a[20005],b[20005],i;
inline bool cmp(data a,data b)//重写cmp函数
{
    return a.z>b.z;
}
inline int find(int x)
{
    if(a[x]==x) return x;
    a[x]=find(a[x]);
    return a[x];
}
inline void ad(int x,int y)//合并
{
    x=find(a[x]);
    y=find(a[y]);
    a[x]=y;
}
inline bool check(int x,int y)//查找
{
    x=find(x);
    y=find(y);
    if(x==y) return true;
    return false;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) a[i]=i;
    for(i=1;i<=m;i++)
        scanf("%d%d%d",&f[i].x,&f[i].y,&f[i].z);
    sort(f+1,f+m+1,cmp);//c党的优越感~
    for(i=1;i<=m+1;i++)//为什么m+1呢？如果运行到m+1会输出0，想想为什么。
    {
        if(check(f[i].x,f[i].y)) {printf("%d",f[i].z);break;}//如果两个罪犯已经在同一监狱就输出 ，并退出
        else
        {
            if(!b[f[i].x]) b[f[i].x]=f[i].y;//标记“敌人”
                else {ad(b[f[i].x],f[i].y);}//将敌人的敌人合并
            if(!b[f[i].y]) b[f[i].y]=f[i].x;
                else {ad(b[f[i].y],f[i].x);}
        }
    }
    return 0;
}

---

洛谷P3386 【模板】二分图最大匹配

代码：

#include <cstdio>
#include <vector>

const int maxn = 1005;

int n, m, t;
int mch[maxn], vistime[maxn];

std::vector<int> e[maxn];

bool dfs(const int u, const int tag);

int main() {
  scanf("%d %d %d", &n, &m, &t);
  for (int u, v; t; --t) {
    scanf("%d %d", &u, &v);
    e[u].push_back(v);
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) if (dfs(i, i)) {
    ++ans;
  }
  printf("%d\n", ans);
}

bool dfs(const int u, const int tag) {
  if (vistime[u] == tag) return false;
  vistime[u] = tag;
  for (auto v : e[u]) if ((mch[v] == 0) || dfs(mch[v], tag)) {
    mch[v] = u;
    return true;
  }
  return false;
}

---

洛谷P1129 [ZJOI2007] 矩阵游戏

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 40005;
int h[N], ne[N * 2], to[N * 2];
int tot, T, n;

void add(int x,int y) {
	ne[++tot] = h[x];
	h[x] = tot, to[tot] = y;
}

int read(void) {
	int x = 0;
	char c = getchar();
	while (!isdigit(c)) c = getchar();
	while (isdigit(c)) {
		x = (x << 3) + (x << 1) + c - '0';
		c = getchar();
	}
	return x;
}

int tim, vis[N], match[N];

int dfs(int x) {
	for (int i = h[x]; i; i = ne[i]) {
		int y = to[i];
		if (vis[y] == tim) continue;
		vis[y] = tim;
		if (!match[y] || dfs(match[y])) {
			match[y] = x; return 1;
		}
	}
	return 0;
}

void pre(void) {
	memset(h, 0, sizeof(h));
	memset(ne, 0, sizeof(ne));
	memset(to, 0, sizeof(to));
	memset(match, 0, sizeof(match));
	tot = 0;
}

int main() {
	T = read();
	while (T--) {
		pre();
		n = read();
		for (int i = 1;i <= n; i++) 
		for (int j = 1;j <= n; j++) {
			int x = read();
			if (x) {
				add(i, j + n); add(j + n, i);
			}
		}
		int ans = 0;
		for (int i = 1;i <= n; i++) 
		tim++, ans += dfs(i);
		if (ans == n) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

---