import java.util.ArrayList; import java.util.Scanner; /* * Man Vo * Problem Number: 11870 * Problem Name: Antonyms */ public class Antonyms { public static void main(String[] args){ Scanner input = new Scanner(System.in); int x = input.nextInt(); ArrayList<String> Output = new ArrayList<String>(); for(int i =0; i<x; i++){ ArrayList<String> Words = new ArrayList<String>(); int synNum = input.nextInt(); int antNum = input.nextInt(); ArrayList<Integer> synFlag = new ArrayList<Integer>(); ArrayList<Integer> antFlag = new ArrayList<Integer>(); int count = 1; for(int j=0; j<synNum; j++){ String word = input.next(); String word2 = input.next(); if(j==0){ Words.add(word); Words.add(word2); synFlag.add(Words.indexOf(word),count); synFlag.add(Words.indexOf(word2),count); continue; } else if(!Words.contains(word) && !Words.contains(word2)){ ++count; Words.add(word); Words.add(word2); synFlag.add(Words.indexOf(word), count); synFlag.add(Words.indexOf(word2), count); continue; } else if(Words.contains(word) | !Words.contains(word2)){ Words.add(word2); synFlag.add(Words.indexOf(word2), synFlag.get(Words.indexOf(word))); continue; } else if(!Words.contains(word) | Words.contains(word2)){ Words.add(word); synFlag.add(Words.indexOf(word), synFlag.get(Words.indexOf(word2))); continue; } else{ continue; } } antFlag.addAll(synFlag); for(int j = 0; j<antFlag.size(); j++){ antFlag.set(j, 0); } for(int k=0; k<antNum; k++){ String word = input.next(); String word2 = input.next(); if(Words.contains(word) && Words.contains(word2)){ antFlag.set(Words.indexOf(word), synFlag.get(Words.indexOf(word2))); antFlag.set(Words.indexOf(word2), synFlag.get(Words.indexOf(word))); for(int l = 0; l<Words.size(); l++){ if(antFlag.get(l)==0 && synFlag.get(l)==antFlag.get(Words.indexOf(word2))){ antFlag.set(l, synFlag.get(Words.indexOf(word2))); continue; } else if(antFlag.get(l)==0 && synFlag.get(l)==antFlag.get(Words.indexOf(word))){ antFlag.set(l, synFlag.get(Words.indexOf(word))); continue; } else continue; } continue; }else if(Words.contains(word) && !Words.contains(word2)){ Words.add(word2); synFlag.add(Words.indexOf(word2), antFlag.get(Words.indexOf(word))); antFlag.add(Words.indexOf(word2), synFlag.get(Words.indexOf(word))); continue; }else if(!Words.contains(word) && Words.contains(word2)){ Words.add(word); synFlag.add(Words.indexOf(word), antFlag.get(Words.indexOf(word2))); antFlag.add(Words.indexOf(word), synFlag.get(Words.indexOf(word2))); continue; } else continue; } for(int m = 0; m<Words.size(); m++){ if(synFlag.get(m)==antFlag.get(m)){ Output.add("NO"); break; } else if(m==Words.size()-1){ Output.add("YES"); }else{ continue; } } } for(int j=0; j<Output.size(); j++){ System.out.println("Case "+(j+1)+": "+ Output.get(j)); } } }The statements and opinions included in these pages are those of only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Isaac Traxler