Page 1 of 1
11393 - Tri-Isomorphism
Posted: Mon Jan 14, 2008 4:13 am
by sonyckson
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.
Posted: Mon Jan 14, 2008 5:26 am
by rio
I did the exact same thing.
-----
Rio
Posted: Mon Jan 14, 2008 10:53 am
by sclo
I'm pretty sure that any graphs with no edges are isomorphic to itself.
Posted: Wed Jan 30, 2008 4:09 am
by fh
Can anyone explain the meaning of "three pairwise-isomorphic subgraphs"? and the two sample cases? I completely don't understand them.
Posted: Wed Jan 30, 2008 12:11 pm
by emotional blind
fh,
let three subgraph G1, G2 and G3
if G1 and G2 are isomorphic, and G2 and G3 are isomorphic and G3 and G1 are isomorphic
then this three are pairwise isomorphic subgraphs.
I think examples will be clear to you now.
Posted: Wed Jan 30, 2008 2:59 pm
by fh
Thx, emotional blind, just got it AC.
Re: 11393 - Tri-Isomorphism
Posted: Mon Apr 07, 2008 5:59 am
by yiuyuho
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.
OK, so...why is the correct output for n=1 is NO? Is that a mistake?