1029 False coin

原创 2007年10月15日 08:42:00
False coin
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 4240   Accepted: 1021

Description
The "Gold Bar"bank received information from reliable sources that in their last group of N coins exactly one coin is false and differs in weight from other coins (while all other coins are equal in weight). After the economic crisis they have only a simple balance available (like one in the picture). Using this balance, one is able to determine if the weight of objects in the left pan is less than, greater than, or equal to the weight of objects in the right pan.
In order to detect the false coin the bank employees numbered all coins by the integers from 1 to N, thus assigning each coin a unique integer identifier. After that they began to weight various groups of coins by placing equal numbers of coins in the left pan and in the right pan. The identifiers of coins and the results of the weightings were carefully recorded.
You are to write a program that will help the bank employees to determine the identifier of the false coin using the results of these weightings.

Input
The first line of the input file contains two integers N and K, separated by spaces, where N is the number of coins (2<=N<=1000 ) and K is the number of weightings fulfilled (1<=K<=100). The following 2K lines describe all weightings. Two consecutive lines describe each weighting. The first of them starts with a number Pi (1<=Pi<=N/2), representing the number of coins placed in the left and in the right pans, followed by Pi identifiers of coins placed in the left pan and Pi identifiers of coins placed in the right pan. All numbers are separated by spaces. The second line contains one of the following characters: '<', '>', or '='. It represents the result of the weighting:
'<' means that the weight of coins in the left pan is less than the weight of coins in the right pan,
'>' means that the weight of coins in the left pan is greater than the weight of coins in the right pan,
'=' means that the weight of coins in the left pan is equal to the weight of coins in the right pan.

Output
Write to the output file the identifier of the false coin or 0, if it cannot be found by the results of the given weightings.

Sample Input

 

Sample Output

 

Source
Northeastern Europe 1998

***************************************************

************************************************************

Source Code
/*
1、出现有左右不等时,没参加的硬币就一定是真的!(感谢2004huangyimin提醒!)
2、出现类似
5 2
1 1 4
=
1 2 5
=
答案是3,共有5个硬币,题目说了总有一个是假币,而另外4个都是真的了(来自faen的提醒)
3、如果一个COIN在 '<' 左右都出现过就一定是NORMAL COIN情况,其他没变。(由 11119999提供)

基本上注意了这些就该过了~~~~
我也wa了n次~~~~对于前人的提醒,小弟感激不尽!

*/
#include <stdio.h>
 #include <string.h>
 #define maxn 1001
 
 int main()
 {
 int tt,n;
 int num,i,j,k,t,total;
 char c[maxn];
 int d[maxn];
 int b[maxn];
 int a[101][maxn];
 int jg[maxn];
 bool p;
 int sign,sign1;
 
 
 //freopen("in.txt","r",stdin);
 
 while (scanf("%d%d",&n,&k)==2)
 {
 tt=0;
 bool q=false;
 total=0;
 memset(d,0,sizeof(d));
 memset(b,0,sizeof(b));
 for (i=1;i<=k;i++)
 {
 scanf("%d",&num);
 
 a[i][0]=0;
 for (j=1;j<=num*2;j++)
 {
 a[i][0]++;
 scanf("%d",&a[i][a[i][0]]);
 }
 scanf("/n");
 scanf("%c",&c[i]);
 if (c[i]=='=')
 {
 for (j=1;j<=num*2;j++)
 b[a[i][j]]=1;
 }
 else 
 {
 total++;
 d[total]=i;
 }
 }
 if (total==0) 
 {
 for (i=1;i<=n;i++)
 if (b[i]!=1) 
 {
 tt++;
 jg[tt]=i;
 }
 }
 else
 {
 for (i=1;i<=n;i++)
 if (b[i]!=1) 
 {
 p=true;
 sign=1;
 for (t=1;t<=a[d[1]][0];t++)
 if (i==a[d[1]][t]) break;
 if (i!=a[d[1]][a[d[1]][0]]&&t-1==a[d[1]][0]) 
 {
 p=false;
 continue;
 }
 if (t<=a[d[1]][0]/2&&c[d[1]]=='<')
 sign=-1;
 else
 if (t>a[d[1]][0]/2&&c[d[1]]=='>')
 sign=-1;
 if (p==false) continue; 
 
 for (j=2;j<=total;j++)
 {
 p=true;
 sign1=1;
 for (t=1;t<=a[d[j]][0];t++)
 
 if (i==a[d[j]][t]) break;
 if (i!=a[d[j]][a[d[j]][0]]&&t-1==a[d[j]][0]) 
 {
 p=false;
 break;
 }
 if (t<=a[d[j]][0]/2&&c[d[j]]=='<')
 sign1=-1;
 else
 if (t>a[d[j]][0]/2&&c[d[j]]=='>')
 sign1=-1;
 if (p==false) break;
 if (sign1!=sign) 
 {
 p=false;
 break;
 }
 }
 if (p==true)
 {
 tt++;
 jg[tt]=i;
 continue;
 }
 }
 }
 if (tt==1) printf("%d/n",jg[tt]);
 else printf("0/n");
 
 }
 return 0;
 }  
3
5 3
2 1 2 3 4
<
1 1 4
=
1 2 5
=

PlayerPrefs存储Vector3等结构数据

孙广东   2016.3.31 之前有网友询问这个问题, 当时我只是 提供了一个思路, 使用json序列化、反序列化。 下面就写出两种(都是只能变成字符串)1、json的序列化、反序列化方式JsonF...
  • u010019717
  • u010019717
  • 2016年03月31日 12:43
  • 1311

BZOJ 1029 JSOI2007 建筑抢修 贪心+堆

题目大意:n个建筑需要抢修,第i个建筑需要T1时间抢修,必须在T2时间之前抢修完毕,求最多能抢修多少建筑 首先我们对T2排序 然后依次修理 但是这样贪心显然是不正确的 比如说这组数据: 5 10...
  • PoPoQQQ
  • PoPoQQQ
  • 2014年10月28日 16:39
  • 2374

利用不均匀硬币产生等概率

转自出处:http://www.gocalf.com/blog/unbalanced-coin.html 问题描述:有一枚不均匀的硬币,已知抛出此硬币后,正面向上的概率为p(0 ...
  • martin_liang
  • martin_liang
  • 2014年12月04日 14:10
  • 1540

POJ-1029-False coin

这个题是说有n个硬币,其中有一个是假币(其重量比真的轻或者重),给你一个天平,经过m次测量,给你m次测量的状态, 问你是否能够找到那个假的硬币,如果能找到输出编号,不能的话输出0。 思路: 1、若...
  • z309241990
  • z309241990
  • 2013年06月29日 10:44
  • 760

1029 False coin

False coinTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12014 Accepted: 3229DescriptionT...
  • hqd_acm
  • hqd_acm
  • 2011年02月27日 10:01
  • 928

【模拟】Poj1029 False Coin

题目地址:http://poj.org/problem?id=1029 题目大意:有一堆硬币,其中一枚是假的,但是不知道它是比真的重还是轻,输入文件给出一些天平称量结果,要求判断出哪一个硬币...
  • u013647282
  • u013647282
  • 2014年02月14日 15:12
  • 529

False coin(P1029)

这个题还算比较巧妙 #include #include #include using namespace std; #define N 1011 int main() { int ...
  • jiangjiashi
  • jiangjiashi
  • 2012年05月12日 10:58
  • 381

poj 1029 False coin 检验硬币真假

False coinTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12026 Accepted: 3230DescriptionT...
  • kongming_acm
  • kongming_acm
  • 2011年02月28日 11:19
  • 760

***POJ1029 False coin ACM解题报告(贪心难题)

被传说中的训练计划虐了一个下午。一个搜索图论DP都没做出来,只好找找简单题做做,其实这题我一开始也想的太简单了,以为统计掉了所有平衡的就可以判断了,感觉其实还是要想挺多的,后来经百度提醒要存不等关系时...
  • Miracle_ma
  • Miracle_ma
  • 2014年12月29日 19:37
  • 540

POJ 1029 False coin 找假币 模拟

题目:有N个硬币,里面有一个硬币是坏的,现在称了M次(称两边放数量一样的硬币)并把结果作为输入,根据称的结果判断第几号硬币是坏的。 例如:输入如下 5 3                 ...
  • qq_36312912
  • qq_36312912
  • 2017年08月07日 09:39
  • 79
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1029 False coin
举报原因:
原因补充:

(最多只允许输入30个字)