UVA 11464 - Even Parity(枚举方法)
来源:互联网 发布:电脑网络修复大师 编辑:程序博客网 时间:2024/05/17 01:38
Description
D
Even Parity
Input: Standard Input
Output: Standard Output
We have a grid of size N x N. Each cell of the grid initially contains a zero(0) or a one(1).
The parity of a cell is the number of 1s surrounding that cell. A cell is surrounded by at most 4 cells (top, bottom, left, right).
Suppose we have a grid of size 4 x 4:
1
0
1
0
The parity of each cell would be
1
3
1
2
1
1
1
1
2
3
3
1
0
1
0
0
2
1
2
1
0
0
0
0
0
1
0
0
For this problem, you have to change some of the 0s to 1s so that the parity of every cell becomes even. We are interested in the minimum number of transformations of 0 to 1 that is needed to achieve the desired requirement.
Input
The first line of input is an integer T (T<30) that indicates the number of test cases. Each case starts with a positive integer N(1≤N≤15). Each of the next N lines contain N integers (0/1) each. The integers are separated by a single space character.
Output
For each case, output the case number followed by the minimum number of transformations required. If it's impossible to achieve the desired result, then output -1 instead.
Sample Input Output for Sample Input
3
3
0 0 0
0 0 0
0 0 0
3
0 0 0
1 0 0
0 0 0
3
1 1 1
1 1 1
0 0 0
Case 1: 0
Case 2: 3
Case 3: -1
题意:
给定n*n(1≤n≤15) 的矩阵,只可以从0变为1,求出最少的变换字数使得每一个数的上下左右和为偶数。
思路:
因为n 最大为15 ,所以第一行最多有2 ^15种情况,枚举第一行的情况,就可以由此计算后面的。利用位运算来枚举第一行的所有情况。
CODE;
#include <iostream>#include <cstdio>#include <algorithm>#include <cmath>#include <string>#include <cstring>#include <queue>#include <stack>#include <vector>#include <set>#include <map>const int inf=0xfffffff;typedef long long ll;using namespace std;int a[20][20], b[20][20];int n;int cal(int s){ memset(b, 0, sizeof(b)); for(int i = 0; i < n; i ++){ if(s & (1<<i)) b[0][i] = 1; else if(a[0][i] == 1) return inf; } for(int i = 1; i < n; i++){//算b[i-1][j]的上左右,从而得到b[i][j]应为多少。 for(int j = 0; j < n; j++){ int sum = 0; if(i > 1) sum += b[i - 2][j]; if(j > 0 ) sum += b[i - 1][j - 1]; if(j < n-1) sum += b[i - 1][j + 1]; b[i][j] = sum % 2; if(a[i][j] == 1 && b[i][j]== 0) return inf; } } int cnt = 0; for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++) if(a[i][j] != b[i][j]) cnt ++; } return cnt;}int main(){ //freopen("in", "r", stdin); int T; scanf("%d", &T); for(int ca = 1; ca <= T; ca++){ scanf("%d", &n); for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++) scanf("%d", &a[i][j]); } int ans = inf; for(int i = 0; i < (1<<n); i++){ ans = min(ans, cal(i)); } if(ans == inf) printf("Case %d: -1\n", ca); else printf("Case %d: %d\n", ca, ans); } return 0;}
- UVA 11464 - Even Parity(枚举方法)
- UVA 11464 - Even Parity(枚举方法)
- UVA - 11464 Even Parity 枚举
- UVA 11464 Even Parity(枚举)
- uva 11464 - Even Parity(暴力枚举)
- UVA - 11464 Even Parity 枚举+递推
- UVa 11464 Even Parity(枚举)
- uva 11464 - Even Parity(暴力枚举)
- UVa 11464 Even Parity (部分枚举)
- uva 11464 Even Parity 模拟 二进制枚举
- UVA 11464 Even Parity(暴力枚举)
- UVA 11464 - Even Parity
- uva 11464 - Even Parity
- Uva-11464-Even Parity
- uva 11464Even Parity
- Uva 11464 - Even Parity
- Uva 11464 - Even Parity
- uva 11464 - Even Parity
- ViewPager & Fragment & Tab
- Cocos2d-X数据、动作、消息的基本操作
- Java访问权限控制修饰符
- linux下android开发环境的搭建
- MFC中线程同步
- UVA 11464 - Even Parity(枚举方法)
- Oracle Redo Strand
- QTP的环境变量
- [Unity3D]Unity3D游戏开发之Logo渐入渐出效果的实现
- cocos2d-x 3.2 之 2048 —— 第五篇
- 《浪潮之巅》13 幕后的英雄--风险投资
- C# GDI+绘制行情系统 —— 行情Listview功能分析(1)
- 笔记本LINUX系统下使用常识:
- 利用Javascript获取当前日期的农历日期