11393 - Tri-Isomorphism
Moderator: Board moderators
11393 - Tri-Isomorphism
Well, i just wanna ask something, i did the "correct" solution ( at least the idea ) during the contest, but i thought the answer for input 1 was "YES" because you can have 3 empty lists of edges for each subgraph and ( as i see ) everything will be ok with the definitions given at the problem statement.... i got 2 WA during the contest, and another WA in another problem because of something similar, perhaps the same, i dont know what is it yet.... what im missunderstanding??? why the correct answer for input 1 is "NO"?? Thanks, Eric.
Can anyone explain the meaning of "three pairwise-isomorphic subgraphs"? and the two sample cases? I completely don't understand them.
Visit my script to hunt UVA problem here:
http://felix-halim.net/uva/hunting/
-----------------------
Felix Halim
http://felix-halim.net/uva/hunting/
-----------------------
Felix Halim
-
- A great helper
- Posts: 383
- Joined: Mon Oct 18, 2004 8:25 am
- Location: Bangladesh
- Contact:
Thx, emotional blind, just got it AC.
Visit my script to hunt UVA problem here:
http://felix-halim.net/uva/hunting/
-----------------------
Felix Halim
http://felix-halim.net/uva/hunting/
-----------------------
Felix Halim
Re: 11393 - Tri-Isomorphism
OK, so...why is the correct output for n=1 is NO? Is that a mistake?sonyckson wrote:Well, i just wanna ask something, i did the "correct" solution ( at least the idea ) during the contest, but i thought the answer for input 1 was "YES" because you can have 3 empty lists of edges for each subgraph and ( as i see ) everything will be ok with the definitions given at the problem statement.... i got 2 WA during the contest, and another WA in another problem because of something similar, perhaps the same, i dont know what is it yet.... what im missunderstanding??? why the correct answer for input 1 is "NO"?? Thanks, Eric.