Counterfeit Dollar
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 42028   Accepted: 13369

Description

Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a different weight
from the other coins but Sally does not know if it is heavier or lighter than the real coins. 

Happily, Sally has a friend who loans her a very accurate balance scale. The friend will permit Sally three weighings to find the counterfeit coin. For instance, if Sally weighs two coins against each other and the scales balance then she knows these two coins
are true. Now if Sally weighs 

one of the true coins against a third coin and the scales do not balance then Sally knows the third coin is counterfeit and she can tell whether it is light or heavy depending on whether the balance on which it is placed goes up or down, respectively. 

By choosing her weighings carefully, Sally is able to ensure that she will find the counterfeit coin with exactly three weighings.

Input

The first line of input is an integer n (n > 0) specifying the number of cases to follow. Each case consists of three lines of input, one for each weighing. Sally has identified each of the coins with the letters A--L. Information on a weighing will be given
by two strings of letters and then one of the words ``up'', ``down'', or ``even''. The first string of letters will represent the coins on the left balance; the second string, the coins on the right balance. (Sally will always place the same number of coins
on the right balance as on the left balance.) The word in the third position will tell whether the right side of the balance goes up, down, or remains even.

Output

For each case, the output will identify the counterfeit coin by its letter and tell whether it is heavy or light. The solution will always be uniquely determined.

Sample Input

1
ABCD EFGH even
ABCI EFJK up
ABIJ EFGH even

Sample Output

K is the counterfeit coin and it is light.

题意是从A到L的dollar,其中有一个跟他们其它的不同,可能是轻了也可能是重了。给了三个在秤上的关系,要你判断出哪一个是伪造的dollar,是轻是重。

做的时候还WA了几次,但AC之后觉得这个题真是水啊。。。不知道为什么只要自己好不容易A完之后就觉得这个题真的很水,为什么当时没有想到呢?就是这种感觉。

咳咳,因为这个题就A到L之中有问题嘛,数据量太小,导致枚举就OK了。所以从A开始就一个一个试吧,如果在even中的语句里出现了,那就排除它的嫌疑。在up语句中出现了,它的flag加3,代表可能是轻的标记。在down语句中出现了,它自己的flag加4,代表可能是重的标记。

然后对12个砝码标记完之后,有标记为1的排除,标记为7 10 11这样的排除,因为不可能出现一个砝码既轻又重的情况,然后找最独特的那一个就是伪造的砝码了。输出即可。

代码:

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
using namespace std; int num[15];
int Test,i,j,flag[15],sum=0;
string left_s[5],right_s[5],bala[5];
char temp_c; void solve()
{
if(bala[1]=="up")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return ;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return;
}
}
}
if(bala[2]=="up")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return;
}
}
}
if(bala[3]=="up")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return ;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return ;
}
}
} if(bala[1]=="down")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return ;
}
}
}
if(bala[2]=="down")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return ;
}
}
}
if(bala[3]=="down")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"light."<<endl;
return;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
sum=1;
cout<<temp_c<<" is the counterfeit coin and it is ";
cout<<"heavy."<<endl;
return ;
}
}
}
} bool pend()
{
int pend_flag=0;
if(bala[1]=="up")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
}
if(bala[2]=="up")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
}
if(bala[3]=="up")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
} if(bala[1]=="down")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
}
if(bala[2]=="down")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
}
if(bala[3]=="down")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
pend_flag=1;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
pend_flag=1;
}
}
if(pend_flag==0)
return false;
}
return true;
}
int main()
{
cin>>Test; while(Test--)
{
memset(flag,0,sizeof(flag));
memset(num,0,sizeof(num));
sum=0; for(i=1;i<=3;i++)
{
cin>>left_s[i]>>right_s[i]>>bala[i];
}
for(temp_c='A';temp_c<='L';temp_c++)
{
if(bala[1]=="even")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
}
if(bala[2]=="even")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
}
if(bala[3]=="even")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
flag[temp_c-'A']=1;
break;
}
}
} if(bala[1]=="up")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] += 4;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] += 3;
}
}
}
if(bala[2]=="up")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] += 4;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] += 3;
}
}
}
if(bala[3]=="up")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=4;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=3;
}
}
} if(bala[1]=="down")
{
for(j=0;j<left_s[1].length();j++)
{
if(left_s[1][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=3;
}
}
for(j=0;j<right_s[1].length();j++)
{
if(right_s[1][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=4;
}
}
}
if(bala[2]=="down")
{
for(j=0;j<left_s[2].length();j++)
{
if(left_s[2][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=3;
}
}
for(j=0;j<right_s[2].length();j++)
{
if(right_s[2][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=4;
}
}
}
if(bala[3]=="down")
{
for(j=0;j<left_s[3].length();j++)
{
if(left_s[3][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=3;
}
}
for(j=0;j<right_s[3].length();j++)
{
if(right_s[3][j]==temp_c)
{
if(flag[temp_c-'A']==1)
continue;
else
flag[temp_c-'A'] +=4;
}
}
}
}
for(temp_c='A';temp_c<='L';temp_c++)
{
num[flag[temp_c-'A']]++;
}
for(i=0;i<=12;i++)
{
if(num[i]==1 && i!=7 && i!=10 && i!=11)
{
for(temp_c='A';temp_c<='L';temp_c++)
{
if(flag[temp_c-'A']==i)
{
if(pend())
{
solve();
}
}
}
}
}
} return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 1013:Counterfeit Dollar的更多相关文章

  1. 九度OJ 1150:Counterfeit Dollar(假美元) (分析、检验)

    时间限制:1 秒 内存限制:32 兆 特殊判题:否 提交:485 解决:215 题目描述: Sally Jones has a dozen Voyageur silver dollars. Howev ...

  2. Poj 1013 Counterfeit Dollar / OpenJudge 1013(2692) 假币问题

    1.链接地址: http://poj.org/problem?id=1013 http://bailian.openjudge.cn/practice/2692 http://bailian.open ...

  3. POJ 1013 Counterfeit Dollar

    Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 36206   Accepted: 11 ...

  4. Counterfeit Dollar 分类: POJ 2015-06-12 15:28 19人阅读 评论(0) 收藏

    Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 41559   Accepted: 13 ...

  5. POJ1013 Counterfeit Dollar

    题目来源:http://poj.org/problem?id=1013 题目大意:有12枚硬币,其中有一枚假币.所有钱币的外表都一样,所有真币的重量都一样,假币的重量与真币不同,但我们不知道假币的重量 ...

  6. POJ 1013 小水题 暴力模拟

    Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 35774   Accepted: 11 ...

  7. Counterfeit Dollar -----判断12枚钱币中的一个假币

     Counterfeit Dollar Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u ...

  8. poj1013.Counterfeit Dollar(枚举)

    Counterfeit Dollar Time Limit: 1 Sec  Memory Limit: 64 MB Submit: 415  Solved: 237 Description Sally ...

  9. POJ 3321:Apple Tree + HDU 3887:Counting Offspring(DFS序+树状数组)

    http://poj.org/problem?id=3321 http://acm.hdu.edu.cn/showproblem.php?pid=3887 POJ 3321: 题意:给出一棵根节点为1 ...

随机推荐

  1. 51nod 1099:任务执行顺序 贪心

    1099 任务执行顺序 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题  收藏  取消关注 有N个任务需要执行,第i个任务计算时占R[i]个空间,而后会释放一部分, ...

  2. 【LeetCode】三角形最小路径和

    [问题]给定一个三角形,找出自顶向下的最小路径和.每一步只能移动到下一行中相邻的结点上.例如,给定三角形: [ [], [,], [,,], [,,,] ] 自顶向下的最小路径和为 (即, + + + ...

  3. tan?

    痰是一种急.慢性气管--支气管炎,咳.痰.喘.炎是下呼吸道感染的常见主征.下呼吸道感染有急性和慢性之分.急性感染主要的是急性气管--支气管炎,是呼吸系统最常见的一种疾病,多由感染.物理化学刺激或过敏引 ...

  4. 使用jquery版本的viewer.js图片更新的问题

    参考博客: 使用jquery版本的viewer.js图片更新的问题 - cc_fys的博客 - CSDN博客 https://blog.csdn.net/cc_fys/article/details/ ...

  5. Netty 中队列的使用

    任务队列中的Task有3种典型使用场景 用户程序自定义的普通任务 此前代码: 参考https://www.cnblogs.com/ronnieyuan/p/12016712.html NettySer ...

  6. 如何将dmp文件导入到Oracle

    一.概述 在将dmp文件导入到Oracle中之前,需要先创建一个orcale用户.然后使用该用户名和密码,以imp的方式将数据导入到oracle中. 二.执行步骤 1.登陆oracle数据库 a.sq ...

  7. 吴裕雄 Bootstrap 前端框架开发——Bootstrap 字体图标(Glyphicons):glyphicon glyphicon-cog

    <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <meta name ...

  8. 微信浏览器 UA

    mozilla/5.0 (linux; android 5.1.1; mi note pro build/lmy47v) applewebkit/537.36 (khtml, like gecko) ...

  9. GeneWise

    GeneWise是用于将蛋白质序列进行同源预测的软件

  10. js 跳转链接

    1.跳转链接 在当前窗口打开 window.location.href="http://www.baidu.com" 等价于 <a href="baidu.com& ...