codeforces 156B Suspects 暴力

Suspects

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
As Sherlock Holmes was investigating a crime, he identified n suspects. He knows for sure that exactly one of them committed the crime. To find out which one did it, the detective lines up the suspects and numbered them from 1 to n. After that, he asked each one: “Which one committed the crime?”. Suspect number i answered either “The crime was committed by suspect number ai”, or “Suspect number ai didn’t commit the crime”. Also, the suspect could say so about himself (ai = i).

Sherlock Holmes understood for sure that exactly m answers were the truth and all other answers were a lie. Now help him understand this: which suspect lied and which one told the truth?

Input
The first line contains two integers n and m (1 ≤ n ≤  105 , 0 ≤ m ≤ n) — the total number of suspects and the number of suspects who told the truth. Next n lines contain the suspects’ answers. The i-th line contains either “+ai” (without the quotes), if the suspect number i says that the crime was committed by suspect number ai, or “-ai” (without the quotes), if the suspect number i says that the suspect number ai didn’t commit the crime (ai is an integer, 1 ≤ ai ≤ n).

It is guaranteed that at least one suspect exists, such that if he committed the crime, then exactly m people told the truth.

Output
Print n lines. Line number i should contain “Truth” if suspect number i has told the truth for sure. Print “Lie” if the suspect number i lied for sure and print “Not defined” if he could lie and could tell the truth, too, depending on who committed the crime.

Examples
input
1 1
+1
output
Truth
input
3 2
-1
-2
-3
output
Not defined
Not defined
Not defined
input
4 1
+2
-3
+4
-1
output
Lie
Not defined
Lie
Not defined
Note
The first sample has the single person and he confesses to the crime, and Sherlock Holmes knows that one person is telling the truth. That means that this person is telling the truth.

In the second sample there are three suspects and each one denies his guilt. Sherlock Holmes knows that only two of them are telling the truth. Any one of them can be the criminal, so we don’t know for any of them, whether this person is telling the truth or not.

In the third sample the second and the fourth suspect defend the first and the third one. But only one is telling the truth, thus, the first or the third one is the criminal. Both of them can be criminals, so the second and the fourth one can either be lying or telling the truth. The first and the third one are lying for sure as they are blaming the second and the fourth one.

题目链接

题意:福尔摩斯找了n个嫌疑人,其中一个是凶手,他去调查每个人,知道这之中的m个人说的是真话,输入中ai若为正数,则为第i个人说ai是凶手,若为负数,则为第i个人说ai不是凶手,问你其中的哪些人说谎,那些人不是说谎,哪些人的话不能确定。

解题思路:暴力讨论第i个人是凶手的时候,有多少个人说的是真话,若说真话的人等于m,则i为凶手的可能性存在,若只有这一种情况符合,则i必定为凶手,我们即可知道一些人说的话是真是假,或者如果不等于m,则我们可以知道他肯定不是凶手,所以我们也可以知道一些人说的话是真是假,最后输出即可。

#include<cstdio>
#define maxn 100005
int n,m,a[maxn],b[maxn],c[maxn],sum,k,d[maxn];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        if(a[i]>0)  b[a[i]]++;
        else{
            c[-a[i]]++;
            sum++;
        }
    }
    for(int i=1;i<=n;i++){
        if(b[i]+sum-c[i]==m){
            d[i]=1;
            k++;
        }
    }

    for(int i=1;i<=n;i++){
        if(a[i]>0){
            if(d[a[i]]==1&&k==1)    printf("Truth\n");
            else if(d[a[i]]==0) printf("Lie\n");
            else printf("Not defined\n");
        }
        else{
            if(d[-a[i]]==1&&k==1)   printf("Lie\n");
            else if(d[-a[i]]==0)    printf("Truth\n");
            else printf("Not defined\n");
        }
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值