当前位置:网站首页>FZU 1686 龙之谜 重复覆盖
FZU 1686 龙之谜 重复覆盖
2022-07-06 12:56:00 【全栈程序员站长】
大家好,又见面了,我是全栈君。
兑换0,1模型,如。注意,数据的范围
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h>
using namespace std;
const int MaxM = 500;
const int MaxN = 500;
const int maxnode = MaxM*MaxN;
int K,n,m;
struct DLX
{
int n,m,size;
int U[maxnode],D[maxnode],R[maxnode],L[maxnode],Row[maxnode],Col[maxnode];
int H[MaxN],S[MaxM];
int ands,ans[MaxN];
void init(int _n,int _m)
{
ands=0x3f3f3f3f;
n = _n;
m = _m;
for(int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
}
R[m] = 0; L[0] = m;
size = m;
for(int i = 1;i <= n;i++)
H[i] = -1;
}
void Link(int r,int c)
{
++S[Col[++size]=c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if(H[r] < 0)H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void remove(int c)
{
for(int i = D[c];i != c;i = D[i])
L[R[i]] = L[i], R[L[i]] = R[i];
}
void resume(int c)
{
for(int i = U[c];i != c;i = U[i])
L[R[i]]=R[L[i]]=i;
}
bool v[maxnode];
int f()
{
int ret = 0;
for(int c = R[0];c != 0;c = R[c])v[c] = true;
for(int c = R[0];c != 0;c = R[c])
if(v[c])
{
ret++;
v[c] = false;
for(int i = D[c];i != c;i = D[i])
for(int j = R[i];j != i;j = R[j])
v[Col[j]] = false;
}
return ret;
}
void Dance(int d)
{
if(d+f()>=ands) return;
if(R[0] == 0) {ands=min(ands,d);return;}
int c = R[0];
for(int i = R[0];i != 0;i = R[i])
if(S[i] < S[c])
c = i;
for(int i = D[c];i != c;i = D[i])
{
remove(i);
for(int j = R[i];j != i;j = R[j])remove(j);
Dance(d+1);
for(int j = L[i];j != i;j = L[j])resume(j);
resume(i);
}
}
}g;
int mp[20][20],sa,sb,id[20][20];
int main()
{
while(~scanf("%d%d",&n,&m))
{
int tot=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
scanf("%d",&mp[i][j]);
if(mp[i][j]) id[i][j]=++tot;
}
}
scanf("%d%d",&sa,&sb);
g.init(n*m,tot);
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
for(int ii=i,cnt=1;cnt<=sa&&ii<n;ii++,cnt++)
{
for(int jj=j,cnt2=1;cnt2<=sb&&jj<m;jj++,cnt2++)
{
if(mp[ii][jj])
{
g.Link(i*m+j+1,id[ii][jj]);
}
}
}
}
}
g.Dance(0);
printf("%d\n",g.ands);
}
return 0;
}
版权声明:本文博主原创文章,博客,未经同意不得转载。
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/117105.html原文链接:https://javaforall.cn
边栏推荐
- Is it safe to open an account in flush? Which securities company is good at opening an account? Low handling charges
- [MySQL] basic use of cursor
- 爱可可AI前沿推介(7.6)
- 2022 fields Award Announced! The first Korean Xu Long'er was on the list, and four post-80s women won the prize. Ukrainian female mathematicians became the only two women to win the prize in history
- None of the strongest kings in the monitoring industry!
- Seven original sins of embedded development
- js中,字符串和数组互转(二)——数组转为字符串的方法
- 华为设备命令
- JS get array subscript through array content
- El table table - sortable sorting & disordered sorting when decimal and% appear
猜你喜欢
Aiko ai Frontier promotion (7.6)
2017 8th Blue Bridge Cup group a provincial tournament
【深度学习】PyTorch 1.12发布,正式支持苹果M1芯片GPU加速,修复众多Bug
Reinforcement learning - learning notes 5 | alphago
Chris LATTNER, the father of llvm: why should we rebuild AI infrastructure software
面试官:Redis中有序集合的内部实现方式是什么?
Laravel笔记-自定义登录中新增登录5次失败锁账户功能(提高系统安全性)
性能测试过程和计划
Data Lake (VIII): Iceberg data storage format
20220211 failure - maximum amount of data supported by mongodb
随机推荐
ACdreamoj1110(多重背包)
【Redis设计与实现】第一部分 :Redis数据结构和对象 总结
LLVM之父Chris Lattner:为什么我们要重建AI基础设施软件
2022 fields Award Announced! The first Korean Xu Long'er was on the list, and four post-80s women won the prize. Ukrainian female mathematicians became the only two women to win the prize in history
【论文解读】用于白内障分级/分类的机器学习技术
Laravel笔记-自定义登录中新增登录5次失败锁账户功能(提高系统安全性)
R語言可視化兩個以上的分類(類別)變量之間的關系、使用vcd包中的Mosaic函數創建馬賽克圖( Mosaic plots)、分別可視化兩個、三個、四個分類變量的關系的馬賽克圖
Statistical inference: maximum likelihood estimation, Bayesian estimation and variance deviation decomposition
【深度学习】PyTorch 1.12发布,正式支持苹果M1芯片GPU加速,修复众多Bug
968 edit distance
Hardware development notes (10): basic process of hardware development, making a USB to RS232 module (9): create ch340g/max232 package library sop-16 and associate principle primitive devices
None of the strongest kings in the monitoring industry!
Mtcnn face detection
3D人脸重建:从基础知识到识别/重建方法!
@GetMapping、@PostMapping 和 @RequestMapping详细区别附实战代码(全)
7. Data permission annotation
Opencv learning example code 3.2.3 image binarization
Chris LATTNER, the father of llvm: why should we rebuild AI infrastructure software
js中,字符串和数组互转(二)——数组转为字符串的方法
Deployment of external server area and dual machine hot standby of firewall Foundation