tag:blogger.com,1999:blog-29632375.post1220859530740476943..comments2023-06-19T19:45:40.281-07:00Comments on vexorian's blog: Thoughts after SRM 507Unknownnoreply@blogger.comBlogger3125tag:blogger.com,1999:blog-29632375.post-6573075763447789132011-06-01T14:52:56.604-07:002011-06-01T14:52:56.604-07:00Lots of people got challenged in the 250 points :p...Lots of people got challenged in the 250 points :p, I am on div2 it was the 500 there.. it was a nice srm and I almost got to the div1 :)<br />I am following now the blog for editorials for the tc matches :D the explanations are great!<br /><br />By the way, anyone could help me on this UVa problem?<br /><br />http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1100<br /><br />I get only WAs :/ViVahttps://www.blogger.com/profile/10843947628950372347noreply@blogger.comtag:blogger.com,1999:blog-29632375.post-64687984863455379032011-05-31T12:52:46.787-07:002011-05-31T12:52:46.787-07:00Best STL I have found so far for the 250 is :
se...Best STL I have found so far for the 250 is :<br /><br /><br />set st(all(sticker));<br />int av = 0;<br />for_each(q, st) av += min(2, count(*q, all(sticker)));<br />return av>=6 ? "YES": "NO";vexorianhttps://www.blogger.com/profile/09588316922172217808noreply@blogger.comtag:blogger.com,1999:blog-29632375.post-59810446628065855432011-05-30T13:32:16.451-07:002011-05-30T13:32:16.451-07:00500 pointer was fun. After wasting a hour thinking...500 pointer was fun. After wasting a hour thinking, 5 minutes before intermission phase I understood that it can be solved with brute force. At the end of intermission phase I had the solution, but testing it in practice room (when practice rooms appeared) showed that I had integer overflow.<br /><br />C++ provides easier than std::map way for 250. Just sort the array and remove elements that are equal to two preceding elements. :)Muxecoidhttps://www.blogger.com/profile/01245041086555036600noreply@blogger.com