tag:blogger.com,1999:blog-8676956288282165818.post9173229048118860812..comments2023-09-01T15:13:22.139+06:00Comments on One Problem A Day: UVa 10158 - WarSabbir Yousuf Sannyhttp://www.blogger.com/profile/06850218318798376482noreply@blogger.comBlogger6125tag:blogger.com,1999:blog-8676956288282165818.post-71502155254388607822017-11-08T01:49:57.670+06:002017-11-08T01:49:57.670+06:00I get a time limit exceeded for this problem.I get a time limit exceeded for this problem.Bloghttps://www.blogger.com/profile/12236545920094826066noreply@blogger.comtag:blogger.com,1999:blog-8676956288282165818.post-61845532494289712632015-09-19T07:15:14.340+06:002015-09-19T07:15:14.340+06:00Nice and easy!Nice and easy!Anonymoushttps://www.blogger.com/profile/02543181887170949298noreply@blogger.comtag:blogger.com,1999:blog-8676956288282165818.post-12422987507276974382011-08-16T11:34:54.519+06:002011-08-16T11:34:54.519+06:00@Nadeem, Yes, I've noticed it later that the p...@Nadeem, Yes, I've noticed it later that the problem can be solved in a much more elegant way. Thanks for your suggestion :)Sabbir Yousuf Sannyhttps://www.blogger.com/profile/06850218318798376482noreply@blogger.comtag:blogger.com,1999:blog-8676956288282165818.post-66368730823415001272011-08-09T01:58:06.056+06:002011-08-09T01:58:06.056+06:00A similar problem: https://www.spoj.pl/problems/CH...A similar problem: https://www.spoj.pl/problems/CHAINZobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-8676956288282165818.post-23838392227956496022011-08-07T13:07:07.880+06:002011-08-07T13:07:07.880+06:00Here is a much more easier approach:
Associated wi...Here is a much more easier approach:<br />Associated with each node u, have a complementary node u' which will always be in the opposite set as u.<br /><br />So the functions become like this:<br />setFriends(u,v) {<br />merge(u,v);<br />merge(u',v');<br />}<br />setEnemies(u,v) {<br />merge(u,v');<br />merge(u',v);<br />}<br /><br />int areEnemies(u,v) {<br />return findSet(u) == findSet(v');<br />}<br /><br />You can define the complementary node u' = OFFSET - uNadeem Moiduhttps://www.blogger.com/profile/13795897650911483828noreply@blogger.comtag:blogger.com,1999:blog-8676956288282165818.post-7892000344933979062011-08-07T13:06:11.416+06:002011-08-07T13:06:11.416+06:00This comment has been removed by the author.Nadeem Moiduhttps://www.blogger.com/profile/13795897650911483828noreply@blogger.com