POJ 3279
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 3062 | Accepted: 1178 |
Description
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is colored black on one side and white on the other side.
As one would guess, when a single white tile is flipped, it changes to black; when a single black tile is flipped, it changes to white. The cows are rewarded when they flip the tiles so that each tile has the white side face up. However, the cows have rather large hooves and when they try to flip a certain tile, they also flip all the adjacent tiles (tiles that share a full edge with the flipped tile). Since the flips are tiring, the cows want to minimize the number of flips they have to make.
Help the cows determine the minimum number of flips required, and the locations to flip to achieve that minimum. If there are multiple ways to achieve the task with the minimum amount of flips, return the one with the least lexicographical ordering in the output when considered as a string. If the task is impossible, print one line with the word "IMPOSSIBLE".
Input
Lines 2..M+1: Line i+1 describes the colors (left to right) of row i of the grid with N space-separated integers which are 1 for black and 0 for white
Output
Sample Input
4 4
1 0 0 1
0 1 1 0
0 1 1 0
1 0 0 1
Sample Output
0 0 0 0
1 0 0 1
1 0 0 1
0 0 0 0
Source
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm> using namespace std; const int MAX = ;
const int dx[] = {-,,,,};
const int dy[] = {,-,,,};
int N,M;
int tile[MAX][MAX];
int flip[MAX][MAX];
int opt[MAX][MAX]; int get(int x,int y) {
int c = tile[x][y];
for(int d = ; d < ; ++d) {
int x1 = x + dx[d],y1 = y + dy[d];
if(x1 >= && x1 <= N && y1 >= && y1 < M) {
c += flip[x1][y1];
}
}
return c % ; }
int cal() {
int res = ;
int t[MAX * MAX + ];
for(int i = ; i <= N; ++i) {
for(int j = ; j < M; ++j) {
if(get(i - ,j)) {
flip[i][j] = ;
}
}
} for(int i = ; i < M; ++i) {
if(get(N,i)) return -;
} for(int i = ; i <= N; ++i) {
for(int j = ; j < M; ++j) {
res += flip[i][j];
}
} return res; } void solve() {
int res = -;
for(int s = ; s < ( << M); ++s) {
memset(flip,,sizeof(flip));
for(int i = ; i < M; ++i) {
if(s & ( << i)) flip[][i] = ;
}
int num = cal();
//printf("num = %d\n",num);
if(num >= && (res < || res > num)) {
res = num;
memcpy(opt,flip,sizeof(flip));
} } if(res < ) {
printf("IMPOSSIBLE\n");
} else {
for(int i = ; i <= N; ++i) {
for(int j = ; j < M; ++j) {
printf("%d",opt[i][j]);
if(j != M - ) printf(" "); }
printf("\n");
}
}
} int main()
{
// freopen("sw.in","r",stdin);
scanf("%d%d",&N,&M);
for(int i = ; i <= N; ++i) {
for(int j = ; j < M; ++j) {
scanf("%d",&tile[i][j]);
//printf("%d ",tile[i][j]);
}
//printf("\n");
} solve();
//cout << "Hello world!" << endl;
return ;
}
最新文章
- 在 ML2 中配置 OVS flat network - 每天5分钟玩转 OpenStack(133)
- HTTP请求 GET与POST是怎么实现?
- Linux 平台PostGIS安装
- busybox-1.12.2编译提示“混合的隐含和普通规则”错误解决
- c#调用系统资源大集合-3
- 玩转python之每次处理一个字符
- Selenium模拟JQuery滑动解锁
- vue.js使用webpack发布,部署到服务器上之后在浏览器中可以查看到vue文件源码
- centos 6 安装zabbix 3.0
- :after/:before使用技巧
- PHP全栈从入门到精通1
- [Linux] 关闭防火墙以及开放端口
- HTML5 关于本地操作文件的方法
- centos-1 nginx
- Spring——事务
- SpringBoot 使用 MyBatis 分页插件 PageHelper 进行分页查询
- CSS笔试题
- javascript性能优化之Dom编程性能调优总结
- 【ARM】定时器
- libsvm使用
热门文章
- Ruby使用gets的错误:gets得到的有&#39;\n&#39;,需要使用chomp去掉
- 【转载/修改】ScrollLayout代码修正,追加模仿viewpager滚动速度
- Sqlserver中char,nchar,varchar与Nvarchar的区别分析
- ExtJS 等待两个/多个store加载完再执行操作的方法
- MVC4.0 如何设置默认静态首页index.shtml
- JS全局屏蔽回车事件
- VC++程序中加入自定义声音(PlaySound函数用法)
- Java Day 11
- vsftpd配置文件说明
- 【BZOJ 2120】 数颜色