<?xml version="1.0" encoding="iso-8859-2" ?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" ><channel><title><![CDATA[Play with Trees]]></title><link>http://spoj.com/PT07</link><description> Contest PT07 at Sphere Online Judge </description>
<item><title><![CDATA[Solution for "Play with Trees" Contest]]></title><description><![CDATA[<span class="bold">Solution for &quot;Play with Trees&quot; Contest</span><br><br>
<div style="font-size: 12px">See the original post.<a href="http://adn.cn/blog/article.asp?id=67" target="_blank">http://adn.cn/blog/article.asp?id=67</a><br />

<br />
<br />
<br />
<font size="5"><b>&quot;Play with Trees&quot; Problemset</b></font><br />
<br />
<p align="center"><img src="http://adn.cn/blog/attachments/month_0705/e2007531153930.png" border="0" alt="" /></p><br />
<br />
Here is the problem set in pdf.<br />
<b><a href="http://adn.cn/blog/article.asp?id=67" target="_blank">Click here and download. </a></b><br />
<br />
<br />
<br />

<br />
<br />
<br />
<br />
<font size="5"><b>&quot;Play with Trees&quot; Solutions</b></font><br />
<br />
<p align="center"><img src="http://adn.cn/blog/attachments/month_0705/h2007531154111.png" border="0" alt="" /></p><br />
<br />
<b>Screenshot:</b><br />
<p align="center"><img src="http://adn.cn/blog/attachments/month_0705/9200753115388.png" border="0" alt="" /></p><br />
<br />
Here is the solution in pdf.<br />

<b><a href="http://adn.cn/blog/article.asp?id=67" target="_blank">Click here and download.</a></b><br />
<br />
<b>Contents</b><br />
<ol type=1><br />
<li><b>A</b> Play with a Tree<li><b>B</b> The easiest problem<li><b>C</b> The GbAaY Kingdom<li><b>D</b> Let&#8217;s count 1 2 3<li><b>E</b> Yet another computer network problem<li><b>F</b> A short vacation in Disneyland<li><b>G</b> Colorful Lights Party<li><b>H</b> Search in XML<li><b>I</b> The ants in a tree<li><b>J</b> Query on a tree III<li><b>K</b> JiaJia&#8217;s balloons<li><b>X</b> Vertex Cover<li><b>Y</b> Is it a tree?<li><b>Z</b> Longest path in a tree</ul></ol><br />

<br /><p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Amber]]></dc:creator><pubDate>Thu, 31 May 2007 10:19:16 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2062</guid></item>
<item><title><![CDATA[Problems added to main SPOJ system]]></title><description><![CDATA[You can try them in the 'classical' set (PT07X-Z, A-D, F-K), and problem PT07E is in 'challenge' set. The data-set can be slightly different.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Thu, 03 May 2007 09:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2020</guid></item>
<item><title><![CDATA[Contact us for your prizes]]></title><description><![CDATA[Top 15 people, please contact us thanhvy@gmail.com with your full name, full address, and your country's postal code (if there is). We will send you our gifts as soon as possible.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 30 Apr 2007 16:45:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2017</guid></item>
<item><title><![CDATA[The winners]]></title><description><![CDATA[1. Lou Tiancheng <br>
2. Grosu Codrut <Br>
3. VN no1 <br>
4. Adrian Vladu <br>
5. Luka Kalinovcic <br>
6. Nguyen Minh Hieu <br>
7. Yang Yi <Br>
8. Cheryl <Br>
9. Chenqifeng <br>
10. a_a <br>
11. andyshou <bR>
12. gunners <br>
13. Yixght <br>
14. Jby_yeah <br>
15. gheorghe cosmin <Br>

First 2 winners will receive our gifts (see <i>Prizes</i> page), and each person in top 15 will receive a TopCoder College Tour T-shirt! Special thanks to Ms. Yingying Wu for this sponsor.
<p>
<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 30 Apr 2007 16:30:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2016</guid></item>
<item><title><![CDATA[Final ranklist]]></title><description><![CDATA[Take a look at <i>Ranks</i> page for the final ranklist<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 30 Apr 2007 16:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2015</guid></item>
<item><title><![CDATA[Forum for discussion]]></title><description><![CDATA[You can join us here
<a     href="https://www.spoj.pl/forum/viewforum.php?f=46">forum</a><p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 30 Apr 2007 02:05:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2013</guid></item>
<item><title><![CDATA[Contest session finished]]></title><description><![CDATA[Hope you enjoyed it! :) 
The final rank list will be published in the next few hours.
It's the first time we've held a public contest, so we'd really appreciate your feedback.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 30 Apr 2007 02:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2012</guid></item>
<item><title><![CDATA[Note about ranklist]]></title><description><![CDATA[To keep things smoothly, we don't change anything in rank list of PT07H, but in case there is a tie for a place with prizes, the user who submitted the faster-running program to PT07H will win.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 15:45:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2008</guid></item>
<item><title><![CDATA[Updated all pdfs file]]></title><description><![CDATA[Problem PT07H and PT07G is updated in all pdfs. You can reload it<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 11:55:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2003</guid></item>
<item><title><![CDATA[PT07G Description is updated]]></title><description><![CDATA[Added something in output format to make everything more clear.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 11:34:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2002</guid></item>
<item><title><![CDATA[Ranklist is now ok]]></title><description><![CDATA[Score of PT07E is now correct<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 11:24:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=2004</guid></item>
<item><title><![CDATA[Score of PT07E in overall ranklist is not correct]]></title><description><![CDATA[It'll be fixed soon. <p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 10:30:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1999</guid></item>
<item><title><![CDATA[Problem PT07H is ready for submission]]></title><description><![CDATA[For this problem, you can only submit at most 10 times<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sun, 29 Apr 2007 07:10:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1998</guid></item>
<item><title><![CDATA[Vietnamese version of problem-set]]></title><description><![CDATA[Here is the pdf for all problems' descriptions: 
<a     href="
https://www.spoj.pl/PT07/content/problems_vn.pdf">Vietnamese</a> version.
The English version has been fixed some bugs, you can reload it.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sat, 28 Apr 2007 13:16:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1994</guid></item>
<item><title><![CDATA[The rank list have been fixed. ]]></title><description><![CDATA[Now rank list is correct. <p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Amber]]></dc:creator><pubDate>Sat, 28 Apr 2007 12:40:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1993</guid></item>
<item><title><![CDATA[There is some bug in the rank list.]]></title><description><![CDATA[PT07I is a partly scoring problem. The bug causes the full mark (300) always shown in the rank list even though you got accepted on part of the tests. We will fix it as soon as possible. 
<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Amber]]></dc:creator><pubDate>Sat, 28 Apr 2007 09:47:59 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1992</guid></item>
<item><title><![CDATA[All problems in one file]]></title><description><![CDATA[Here is the pdf for all problems' descriptions: 
<a     href="
https://www.spoj.pl/PT07/content/problems.pdf">English</a> version<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sat, 28 Apr 2007 05:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1991</guid></item>
<item><title><![CDATA[Limit number of submissions for problem PT07E]]></title><description><![CDATA[You can only submit at most 10 times for problem PT07E, the description is updated.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sat, 28 Apr 2007 03:45:38 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1990</guid></item>
<item><title><![CDATA[Feedback is updated]]></title><description><![CDATA[Take a look, some answers may be helpful for you.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sat, 28 Apr 2007 02:16:38 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1989</guid></item>
<item><title><![CDATA[Contest session has just started]]></title><description><![CDATA[There are totally 11 problems, with problem codes from PT07A to PT07K. Problem PT07H is not testable now, but it'll be available pretty soon. The pdfs will be uploaded later. Good luck !<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Sat, 28 Apr 2007 02:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1988</guid></item>
<item><title><![CDATA[Practice session finished]]></title><description><![CDATA[See you tomorrow at Contest session.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Fri, 27 Apr 2007 04:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1984</guid></item>
<item><title><![CDATA[Rejudged Vertex Cover]]></title><description><![CDATA[All wrong things are fixed. It's the last time we rejudge this problem. Please accept our apology.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Thu, 26 Apr 2007 14:40:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1981</guid></item>
<item><title><![CDATA[Delay submitting problem Vertex Cover for 2hrs]]></title><description><![CDATA[We need to fix the judge again. After that, all submissions will be rejudged. You can continue submitting after next 2hrs. We will add more 2hrs for the practice session. Sorry for this inconvenience.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Thu, 26 Apr 2007 12:40:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1980</guid></item>
<item><title><![CDATA[Pratice session - 24hrs left]]></title><description><![CDATA['Feedback' is updated. One more sample case is added to the problem description of PT07X to help some people not being confused.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Thu, 26 Apr 2007 02:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1978</guid></item>
<item><title><![CDATA[Rejudged problem Vertex Cover ]]></title><description><![CDATA[Something wrong with the judge, since some submissions don't pass all cases still get AC. We have rejudged all. <p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Wed, 25 Apr 2007 10:34:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1977</guid></item>
<item><title><![CDATA[Small bug in problem Vertex Cover]]></title><description><![CDATA[The limit of it should be 100000 instead of 10000. The pdf of English version is ok, fixed the online problem-set and Vietnamese version. Sorry for this trouble.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Wed, 25 Apr 2007 02:50:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1976</guid></item>
<item><title><![CDATA[The Practice session has just started]]></title><description><![CDATA[Try to warm up yourself !
Here is the pdf for all problems' descriptions: 
<a     href="
https://www.spoj.pl/PT07/content/practice.pdf">English</a> version and
<a     href="https://www.spoj.pl/PT07/content/practice_vn.pdf">Vietnamese</a> version.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Wed, 25 Apr 2007 02:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1973</guid></item>
<item><title><![CDATA[Schedule of Play with Trees]]></title><description><![CDATA[<div align="left">
<li>Practice session
</li><p><a href="http://www.timeanddate.com/worldclock/fixedtime.html?month=4&day=25&year=2007&hour=0&min=0&sec=0&p1=0">
  April 25th, 2007 0:00AM</a>
  - 
  <a href="http://www.timeanddate.com/worldclock/fixedtime.html?month=4&day=27&year=2007&hour=0&min=0&sec=0&p1=0">
  April 27th, 2007 0:00AM</a>
  (GMT / UTC)
  <br/>

SPOJ (CEST) is UTC +2, Beijing (CST) is UTC +8, and Hanoi is UTC +7

<li>Contest session</li><p>
<a href="http://www.timeanddate.com/worldclock/fixedtime.html?month=4&day=28&year=2007&hour=0&min=0&sec=0&p1=0">April 28th, 2007 0:00AM</a>
- 
<a href="http://www.timeanddate.com/worldclock/fixedtime.html?month=4&day=30&year=2007&hour=0&min=0&sec=0&p1=0">
April 30th, 2007 0:00AM</a>
(GMT / UTC)
<br/>

SPOJ (CEST) is UTC +2, Beijing (CST) is UTC +8, and Hanoi is UTC +7

</p>
</div><p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Amber]]></dc:creator><pubDate>Tue, 27 Mar 2007 06:32:38 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1916</guid></item>
<item><title><![CDATA[Choose your favorite skin]]></title><description><![CDATA[If you want to change the interface, you can choose "skin 1" or "skin 2" or "skin 3" at the bottom of this page.<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 26 Mar 2007 09:00:00 +0200</pubDate><guid>http://spoj.com/PT07/?rss=1959</guid></item>
<item><title><![CDATA[Direct way to send us feedback]]></title><description><![CDATA[You can send us feedback by submitting a <i>text</i> file at 
<a     href="https://www.spoj.pl/PT07/problems/PT07CON/">Feedback</a> page<p>Visit the website: <a href='http://spoj.com/PT07/'>http://spoj.com/PT07/</a>]]></description><dc:creator><![CDATA[Thanh-Vy Hua]]></dc:creator><pubDate>Mon, 19 Mar 2007 21:40:00 +0100</pubDate><guid>http://spoj.com/PT07/?rss=1944</guid></item>
</channel></rss>