当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5526:Lie

题目描述
There are N students in a grade, each student belongs to only one class.Now all they standing in a row,but students in the same class are not necessarily going to stand together. Everyone will say a sentence like "Well,there are Ai my classmates stand on my left,as well as Bi my classmates on the right".But not everyone will tell the truth,the teacher also forgot their order of speech.Now the teacher want to know maximum number of people say without contradiction.
输入解释
There are multiple test cases, no more than 100 cases.
In each test case, the first line contains a single integer N.$(1\leq N\leq 1000 )$
The following N lines specify the people. Each of them contains two integers Ai and Bi separated by single spaces.$(0\leq Ai,Bi\leq 1000 )$
输出解释
For each test case,output the answer in a line.
输入样例
3
0 2
2 0
3 0
5
0 0
1 0
0 0
0 0
0 0
输出样例
2
4
来自杭电HDUOJ的附加信息
Recommend hujie

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5526

最后修改于 2020-10-25T23:23:27+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
4000/2000MS(Java/Others) 131072/131072K(Java/Others)