Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package com.company;
- import java.util.ArrayList;
- import java.util.HashMap;
- import java.util.Scanner;
- import java.util.TreeMap;
- public class Main {
- public static TreeMap<Integer,ArrayList<Integer>> pairs = new TreeMap<>();
- public static void getBetter(ArrayList<Integer> better, int film)
- {
- if (pairs.containsKey(film)) {
- ArrayList<Integer> cur = pairs.get(film);
- for (int z:cur) {
- if (!better.contains(z))
- {
- better.add(z);
- getBetter(better,z);
- }
- }
- }
- }
- public static void main(String[] args) {
- int n_girls, n_pairs;
- Scanner sc = new Scanner(System.in);
- n_girls = sc.nextInt();
- n_pairs = sc.nextInt();
- for (int i = 0; i < n_pairs; i++) {
- Integer[] tmp = new Integer[2];
- tmp[0] = sc.nextInt();
- tmp[1] = sc.nextInt();
- if (pairs.containsKey(tmp[1]))
- {
- pairs.get(tmp[1]).add(tmp[0]);
- }
- else {
- ArrayList<Integer> values = new ArrayList<>();
- values.add(tmp[0]);
- pairs.put(tmp[1], values);
- }
- }
- HashMap<Integer,ArrayList<Integer>> betterArray = new HashMap<>();
- ArrayList<String> answ = new ArrayList<>();
- Integer[] anceta= new Integer[3];
- for (int i = 0; i <n_girls ; i++) {
- anceta[0] = sc.nextInt();
- anceta[1] = sc.nextInt();
- anceta[2] = sc.nextInt();
- boolean algood = true;
- for (int c=0; c<anceta.length;c++) {
- ArrayList<Integer> b = new ArrayList<>();
- if (betterArray.containsKey(anceta[c]))
- {
- b = betterArray.get(anceta[c]);
- }
- else {
- getBetter(b, anceta[c]);
- betterArray.put(anceta[c],b);
- }
- if (b.size()>c) algood = false;
- else
- {
- for (int d:b) {
- boolean exist = false;
- for (int j = c-1; j >=0 ; j--) {
- if (d==anceta[j])
- {
- exist = true;
- break;
- }
- }
- if (!exist)
- {
- algood = false;
- break;
- }
- }
- }
- if (!algood) break;
- }
- if (algood)
- {
- answ.add("honest");
- }
- else
- {
- answ.add("liar");
- }
- }
- for (String an:answ) {
- System.out.println(an);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement