思路:题目的模型就是简单的最大流.
但是点数较多.直接建图的话,肯定超时.
这边需要采用一定的技巧.
由于m<10
所以可以按照可以去的行星的情况进行合并相同点.
能去的行星全部相同的就是同一个点,在建图的时候,流量就是这些人的数量就可以了.
这样子的话,建图的点就可以缩小到1024个点.非常给力.
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAXN 200010
#define MAXM 10000040
#define INF 0x7ffffff
int head[MAXN], dep[MAXN], gap[MAXN], cur[MAXN];
int cnt;
int bit[11];
int num[1025];
//将情况相同的点,也就是可以到一样的行星上的人给合并成一个人,只是流量增多了.
struct edge
{
int v;
int cap;
int flow;
int next;
}edg[MAXM];
struct work
{
int p, s, e;
}w[MAXN];
void init()
{
cnt = 0;
memset(head, -1, sizeof(head));
memset(num, 0, sizeof(num));
}
void addedge(int u, int v, int w, int rw = 0)
{
edg[cnt].v = v;
edg[cnt].cap = w;
edg[cnt].flow = 0;
edg[cnt].next = head[u];
head[u] = cnt++;
edg[cnt].v = u;
edg[cnt].cap = rw;
edg[cnt].flow = 0;
edg[cnt].next = head[v];
head[v] = cnt++;
}
int Q[MAXN];
void BFS(int start, int end)
{
memset(dep, -1, sizeof(dep));
memset(gap, 0, sizeof(gap));
gap[0] = 1;
int front = 0, rear = 0;
dep[end] = 0;
Q[rear++] = end;
while (front != rear)
{
int u = Q[front++];
for (int i = head[u]; i != -1; i = edg[i].next)
{
int v = edg[i].v;
if (dep[v] != -1)continue;
Q[rear++] = v;
dep[v] = dep[u] + 1;
gap[dep[v]]++;
}
}
}
int S[MAXN];
int sap(int start, int end, int n)
{
BFS(start, end);
memcpy(cur, head, sizeof(head));
int top = 0;
int u = start;
int ans = 0;
while (dep[start] < n)
{
if (u == end)
{
int Min = INF;
int inser;
for (int i = 0; i < top; i++)
if (Min>edg[S[i]].cap - edg[S[i]].flow)
{
Min = edg[S[i]].cap - edg[S[i]].flow;
inser = i;
}
for (int i = 0; i < top; i++)
{
edg[S[i]].flow += Min;
edg[S[i] ^ 1].flow -= Min;
}
ans += Min;
top = inser;
u = edg[S[top] ^ 1].v;
continue;
}
bool flag = false;
int v;
for (int i = cur[u]; i != -1; i = edg[i].next)
{
v = edg[i].v;
if (edg[i].cap - edg[i].flow&&dep[v] + 1 == dep[u])
{
flag = true;
cur[u] = i;
break;
}
}
if (flag)
{
S[top++] = cur[u];
u = v;
continue;
}
int Min = n;
for (int i = head[u]; i != -1; i = edg[i].next)
if (edg[i].cap - edg[i].flow&&dep[edg[i].v] < Min)
{
Min = dep[edg[i].v];
cur[u] = i;
}
gap[dep[u]]--;
if (!gap[dep[u]])return ans;
dep[u] = Min + 1;
gap[dep[u]]++;
if (u != start)u = edg[S[--top] ^ 1].v;
}
return ans;
}
int Scan()//读入外挂
{
int res = 0, ch, flag = 0;
if ((ch = getchar()) == '-') //判断正负
flag = 1;
else if (ch >= '0' && ch <= '9') //得到完整的数
res = ch - '0';
while ((ch = getchar()) >= '0' && ch <= '9')
res = res * 10 + ch - '0';
return flag ? -res : res;
}
int main()
{
int n, m;
bit[0] = 1;
for (int i = 1; i <= 10; i++)
bit[i] = bit[i - 1] << 1;
while (~scanf("%d%d", &n, &m))
{
init();
int a;
int E =1024+m + 1;
int temp = 0;
for (int i = 1; i <= n; i++)
{
temp = 0;
for (int j = 0; j <m; j++)
{
a = Scan();
temp += a*bit[j];
}
num[temp]++;
}
for (int i = 1; i < 1024; i++)
{
if (num[i] == 0)continue;
addedge(0, i, num[i]);
for (int j = 0; j < 10;j++)
if (i&bit[j])
addedge(i, 1025 + j, num[i]);
}
for (int i = 0; i < m; i++)
{
a = Scan();
addedge(1025 + i, E, a);
}
if (sap(0, E, 2016+m) == n)
puts("YES");
else
puts("NO");
}
}
时间952S,刚好压时间,看排行榜上有62ms的,不知道怎么做的,有知道的巨巨教我.不胜感激