시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
5 초 | 512 MB | 210 | 174 | 85 | 75.221% |
As the leader of the Evil League of Evil, Bad Horse has a lot of problems to deal with. Most recently, there have been far too many arguments and far too much backstabbing in the League, so much so that Bad Horse has decided to split the league into two departments in order to separate troublesome members. Being the Thoroughbred of Sin, Bad Horse isn't about to spend his valuable time figuring out how to split the League members by himself. That what he's got you -- his loyal henchman -- for.
The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with a positive integer M on a line by itself -- the number of troublesome pairs of League members. The next M lines each contain a pair of names, separated by a single space.
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is either "Yes" or "No", depending on whether the League members mentioned in the input can be split into two groups with neither of the groups containing a troublesome pair.
2 1 Dead_Bowie Fake_Thomas_Jefferson 3 Dead_Bowie Fake_Thomas_Jefferson Fake_Thomas_Jefferson Fury_Leika Fury_Leika Dead_Bowie
Case #1: Yes Case #2: No
Contest > Google > Google's Coding Competitions > Google APAC 2016 University Graduates Test > Practice Round APAC test 2016 A2번
Contest > Google > Google's Coding Competitions > Google of Greater China Test for New Grads of 2014 > Practice Round China New Grad Test 2014 A2번
Contest > Google > Google's Coding Competitions > EuroPython 2013 > EuroPython 2013 C2번
Contest > Google > Kick Start > Google Kick Start 2015 > Practice Round C2번
Contest > Google > Kick Start > Google Kick Start 2013 > Practice Round C2번