POJ 3279 Fliptile 二进制
来源:互联网 发布:mac pagedown 编辑:程序博客网 时间:2024/05/22 00:36
Fliptile
Time Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %lld & %llu
Submit
Status
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
Line 1: Two space-separated integers: M and N
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
Lines 1.. M: Each line contains N space-separated integers, each specifying how many times to flip that particular location.
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
USACO 2007 Open Silver
注意要求字典序输出 所以在枚举状态时要注意了
#include<stdio.h>#include<string>#include<cstring>#include<queue>#include<algorithm>#include<functional>#include<vector>#include<iomanip>#include<math.h>#include<iostream>#include<sstream>#include<stack>#include<set>#include<map>using namespace std;const int MAX=20;const int dX[5]= {-1,0,0,0,1};const int dY[5]= {0,-1,0,1,0};int pic[MAX][MAX];int ans[MAX][MAX];int temp[MAX][MAX];int M,N;int get(int x,int y){ int c=pic[x][y]; for (int d=0; d<5; d++) { int nx=x+dX[d],ny=y+dY[d]; if (0<nx&&nx<=M&&0<ny&&ny<=N) c+=temp[nx][ny]; } return c%2;}int cal(){ for (int i=2; i<=M; i++) for (int j=1; j<=N; j++) if (get(i-1,j)==1) temp[i][j]=1; for (int j=1; j<=N; j++) if (get(M,j)==1) return -1; int res=0; for (int i=1; i<=M; i++) for (int j=1; j<=N; j++) res+=temp[i][j]; return res;}void solve(){ int res=-1; for (int i=0; i<(1<<N); i++) { memset(temp,0,sizeof(temp)); for (int j=1; j<=N; j++) temp[1][N+1-j]=i>>(j-1)&1; int num=cal(); if (num>=0&&(res<0||num<res)) { res=num; memcpy(ans,temp,sizeof(temp)); } } if (res<0) cout<<"IMPOSSIBLE\n"; else for (int i=1; i<=M; i++) for (int j=1; j<=N; j++) cout<<ans[i][j]<<(j==N?'\n':' ');}int main(){ cin.sync_with_stdio(false); while (cin>>M>>N) { for (int i=1;i<=M;i++) for (int j=1;j<=N;j++) cin>>pic[i][j]; solve(); } return 0;}
- POJ 3279 Fliptile 二进制
- poj 3279 Fliptile(二进制暴力)
- poj 3279 Fliptile 二进制枚举
- POJ 3279 Fliptile (二进制枚举+模拟)
- POJ 3279 Fliptile (二进制+搜索)
- POJ 3279 Fliptile 反转 (二进制枚举)
- POJ -3279 Fliptile (二进制转换,枚举每行)
- POJ 3279 Fliptile(二进制枚举暴力)
- 【POJ】3279 Fliptile(十字变换搜索+二进制枚举)
- POJ 3279 Fliptile(二进制+暴 力) UVALive 3953
- POJ.3279 Fliptile (搜索+二进制枚举+开关问题)
- POJ-3279-Fliptile
- POJ 3279 Fliptile
- poj 3279 Fliptile
- POJ 3279 Fliptile
- poj 3279 Fliptile
- POJ 3279 Fliptile
- poj 3279 Fliptile
- 最长上升子序列的初步学习
- hdu 2531 Catch him (块状BFS) + 常见BFS的错因
- Centos 6.5 Install DHCP Server
- SQLite对数据进行增删改查
- zzulioj-1908-小火山的围棋梦想【DFS】(好题)
- POJ 3279 Fliptile 二进制
- ProgressBar进度条
- return i++
- 数据结构实验之查找一:二叉排序树
- C++ Primer 第15章 知识点回顾
- Servlet生命周期及运行过程
- 浅谈C++中内存分配、函数调用和返回值问题
- POJ 2492 A Bug's Life(并查集)
- 数码相机一些知识前沿