zoukankan      html  css  js  c++  java
  • [PAT] 1148 Werewolf

    Werewolf(狼人杀) is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,

    • player #1 said: "Player #2 is a werewolf.";
    • player #2 said: "Player #3 is a human.";
    • player #3 said: "Player #4 is a werewolf.";
    • player #4 said: "Player #5 is a human."; and
    • player #5 said: "Player #4 is a human.".

    Given that there were 2 werewolves among them, at least one but not all the werewolves were lying, and there were exactly 2 liars. Can you point out the werewolves?

    Now you are asked to solve a harder version of this problem: given that there were NNN players, with 2 werewolves among them, at least one but not all the werewolves were lying, and there were exactly 2 liars. You are supposed to point out the werewolves.

    Input Specification:

    Each input file contains one test case. For each case, the first line gives a positive integer NNN (5≤N≤1005 le N le 1005N100). Then NNN lines follow and the iii-th line gives the statement of the iii-th player (1≤i≤N1 le i le N1iN), which is represented by the index of the player with a positive sign for a human and a negative sign for a werewolf.

    Output Specification:

    If a solution exists, print in a line in ascending order the indices of the two werewolves. The numbers must be separated by exactly one space with no extra spaces at the beginning or the end of the line. If there are more than one solution, you must output the smallest solution sequence -- that is, for two sequences A=a[1],...,a[M]A = { a[1], ..., a[M] }A=a[1],...,a[M] and B=b[1],...,b[M]B = { b[1], ..., b[M] }B=b[1],...,b[M], if there exists 0≤k<M0 le k < M0k<M such that a[i]=b[i]a[i]=b[i]a[i]=b[i] (i≤ki le kik) and a[k+1]<b[k+1]a[k+1]<b[k+1]a[k+1]<b[k+1], then AAA is said to be smaller than BBB. In case there is no solution, simply print No Solution.

    Sample Input 1:

    5
    -2
    +3
    -4
    +5
    +4
    

    Sample Output 1:

    1 4
    

    Sample Input 2:

    6
    +6
    +3
    +1
    -5
    -2
    +4
    

    Sample Output 2 (the solution is not unique):

    1 5
    

    Sample Input 3:

    5
    -2
    -3
    -4
    -5
    -1
    

    Sample Output 3:

    No Solution




     1 package pattest;
     2 
     3 import java.util.ArrayList;
     4 import java.util.List;
     5 import java.util.Scanner;
     6 
     7 /**
     8  * @Auther: Xingzheng Wang
     9  * @Date: 2019/2/27 21:34
    10  * @Description: pattest
    11  * @Version: 1.0
    12  */
    13 public class PAT1148 {
    14     public static void main(String[] args) {
    15         Scanner sc = new Scanner(System.in);
    16         int n = sc.nextInt();
    17         int[] v = new int[n + 1];
    18         for (int i = 1; i <= n; i++)v[i] = sc.nextInt();
    19         for (int i = 1; i <= n; i++) {
    20             for (int j = i + 1; j <= n; j++) {
    21                 List<Integer> lie = new ArrayList<>();
    22                 int[] a = new int[n + 1];
    23                 for (int k = 0; k <= n ; k++) {
    24                     a[k] = 1;
    25                 }
    26                 a[i] = a[j] = -1;
    27                 for (int k = 1; k <= n; k++) {
    28                     if (v[k] * a[Math.abs(v[k])] < 0) lie.add(k);
    29                 }
    30                 if (lie.size() == 2 && a[lie.get(0)] + a[lie.get(1)] == 0) {
    31                     System.out.print(i + " " + j);
    32                     return;
    33                 }
    34             }
    35         }
    36         System.out.print("No Solution");
    37     }
    38 }
  • 相关阅读:
    如何从你的缓存分析全世界
    Java Collection Framework概述
    用Reveal分析第三方App的UI
    三种经典iPhone上网络抓包方法详解
    HTTPS时代全面到来,你准备好了吗?
    从“埋点技术已死?”开始说起
    访客至上的Web、移动可用性设计--指导原则
    动画原理——图形填充
    动画原理——曲线
    动画原理——绘画API
  • 原文地址:https://www.cnblogs.com/PureJava/p/10498249.html
Copyright © 2011-2022 走看看