poj 2531(按位暴力枚举2^20很easy)
来源:互联网 发布:网络上赌博怎么处罚 编辑:程序博客网 时间:2024/06/04 19:53
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8492 Accepted: 3928
Description
A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts.
A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks.
Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him.
The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).
A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks.
Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him.
The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).
Input
The first line of input contains a number of nodes N (2 <= N <= 20). The following N lines, containing N space-separated integers each, represent the traffic matrix C (0 <= Cij <= 10000).
Output file must contain a single integer -- the maximum traffic between the subnetworks.
Output file must contain a single integer -- the maximum traffic between the subnetworks.
Output
Output must contain a single integer -- the maximum traffic between the subnetworks.
Sample Input
30 50 3050 0 4030 40 0
Sample Output
90
Source
Northeastern Europe 2002, Far-Eastern Subregion'
刚开始考虑用搜索之类的办法,结果发现n<=20,直接2^20枚举就好了。
贡献了一次WA,需要注意的是 移位运算符<<运算优先级是低于减法运算符- 的。
因此 1<<n - 1 和 1<<(n-1)是等价的。
其实只需要枚举[1, 1<<n-1] 就可以。
因为后面的跟前面的是对称的。
例如:
001 110
010 101
011 100
刚开始考虑用搜索之类的办法,结果发现n<=20,直接2^20枚举就好了。
贡献了一次WA,需要注意的是 移位运算符<<运算优先级是低于减法运算符- 的。
因此 1<<n - 1 和 1<<(n-1)是等价的。
其实只需要枚举[1, 1<<n-1] 就可以。
因为后面的跟前面的是对称的。
例如:
001 110
010 101
011 100
- poj 2531(按位暴力枚举2^20很easy)
- poj 3102(暴力枚举)
- POJ 2718 暴力枚举
- POJ-----3279暴力枚举
- POJ 3174 暴力枚举
- poj 3080 暴力法 KMP+暴力枚举
- poj 1248 Safecracker(暴力枚举)
- POJ 1068 Parencodings(暴力枚举)
- poj 3671(暴力 枚举)
- POJ-2078 Matrix,暴力枚举!
- HDU 2601 An easy problem(暴力枚举/质因子分解)
- CF Lucky Numbers (easy) (dfs简单枚举/next_permutation暴力)
- poj 3450 KMP+暴力枚举(类似于3080)
- POJ 1226 Substrings 暴力枚举+KMP算法
- poj 1166 The Clocks 暴力枚举
- POJ 3080 Blue Jeans 暴力枚举+KMP
- POJ 3450 Corporate Identity 暴力枚举+KMP
- POJ 3450Corporate Identity(暴力枚举+KMP)
- Java学习第三课 面向对象编程
- 程序设计思考
- Install WAS6.1+IHS for Linux(64bit)
- android adb启动失败问题 adb server is out of date. killing... ADB server didn't ACK * failed to start daem
- Linux下安装jdk1.6
- poj 2531(按位暴力枚举2^20很easy)
- 数组与内存控制
- 无线传感器网络覆盖盲区的发现与修复方法研究
- poj 1416(水dfs搜索题,整数预先转化为字符串)
- C#定时执行一个操作
- UVA 152 Tree's a Crowd (简单计算)
- java编程规范
- poj 2676(dfs求解数独问题,对行列和格子分别加bool数组优化搜索)
- TCategoryPanelGroup 收起 展开 控件 收缩 伸展