Slashdot Mirror
ACM Programming Contest Results
An anonymous submitter writes: "Shanghai Jiao Tong University has won the 2002 ACM International Collegiate Programming Contest with six of nine problems solved. Also solving six problems were MIT (2nd), University of Waterloo (3rd), Tsinghua University (4th), and Stanford University (5th). You can view the problems online, as well as the final standings. Congratulations to all!"
Could someone post a link with an ASCII/Postscript/html converted list of problems?
.
Hey Taco, give it up, and go play those gay blizzard games on windows.
God, you are ignorant.
Chinese people != Chinese government
Just like:
You != American government
The spirit after 9/11 is NOT about rallying around our nation. It's about rallying AGAINST terrorists.
Taking into consideration how ignorant you really are, you probably have no idea as to the number of Chinese citizens (non-government) died on 9/11 (at all three locations: NYC, D.C. and P.A.)
Sit down, and STFU.
Is your xenophobia necessary? Those students are no more personally responsible for their country's ills than I am for the idiot in the White House.
If you want China to change, engagement and dialog weaken their system not small-penised posturing.
I love my country, but I'm not a crass, knuckle-dragging, flag-waving, trite and weepy Pavlovian zombie about it.
BTW, did you have a flag strapped to your smog belching SUV/pickup/TransAm/Camero/Pacer before or after 9/11?
Any moron can wave a flag, not everyone can figure out what it stands for.
If you don't get this, I'll use smaller words next time.
For the sake of "our nation", I hope this was meant to be a sarcastic joke.
---
Open Source Shirts
Is this a joke? Or are you a real fascist?
Ittai
Go waterloo!
"Caffeine is not an option. Caffeine is a way of life."
Kids from an axis-of-evil state (Iran - Sharif University of Technology) did quite well too (ranked 18), better than Caltech, Cornell, Chicago, UT Austin, Tokyo, and UC San Diego.
Good idea, lets start with the greatest act of terrorism of all time, the vietnam war? How many millions of vietnamese died, how many tens of thousands of americans? I like the way that every US vietnam war movie treats the actual vietnamese as some sort of incidental part of the war. J***S, it was their country, and their people that died, much more than the US.
Microsoft - Where would you like to go today, Maybe Jail?
Bush and friends cannot quite make up their minds on China. Prior to 9/11, they were being set up as the axis of evil, to justify massive increase in arms funding. Post 9/11, everything has become a little confused. But the need for the arms industry is much bigger than NK, Iraq or Iran can satisfy, there fore there is a LOT of pressure to keep China on the agenda behind the scenes.
Microsoft - Where would you like to go today, Maybe Jail?
Toil for Oil
/ooo*
/OOOOO\
Input: oil.in
Prospecting for new sources of oil has become a high-technology industry. With improved drilling technology it has become economically viable to seek out ever smaller and harder to reach deposits of oil. However, using exploratory drilling to locate these deposits is not cost-efficient, so researchers have developed methods to detect oil indirectly.
One such method to detect oil is sonar, which uses reflected sound waves to locate caves in underground rock formations. Determining how much oil can be contained in such a cave is a difficult problem.
gf +
/ \
y
+-------+
filter lameness *
-- --
junk ' -- ---
, -- --
. -=- +ooooooo+
; -- -- -=-O---
-- --- +
-- --
+ + ' +
*ooooooo--- ---o---
--OOOOOOOO+OOOOOOO+
junk ---OOOOOOOOOOO--
---OOOOO---
filter --O--
defeater +
In this problem, you will be given some cross-sections of underground caves, represented by polygons such as the ones shown in the figure. Some of the points bounding the polygon may be holes through which oil can seep out into the surrounding rock (represented by * in the figure). Given the polygonal shape of the cave and the positions of the holes, you must compute the maximum amount of oil that could be in the cave (shown as gray shaded areas in the figure). This amount is limited by the fact that, in any connected body of oil, the oil level can never be above a hole, since it would drain into the surrounding rock instead.
Input
The input contains several cave descriptions, each in the form of a polygon that specifies a cross-section of a cave.
The first line of each description contains a single integer n, representing the number of points on the polygon (3 <= n <= 100).
Each of the following n lines contains three integers x[i], y[i], h[i]. The values (x[i], y[i]) give the positions of the points on the boundary of the polygon in counterclockwise order. The polygon is simple--that is, it does not cross or touch itself. The value of h[i] is equal to 1 if the point is a hole through which oil can seep out, and 0 otherwise. The "upward" direction in each case is the positive y-axis.
The input is terminated by a zero on a line by itself.
Output
For each cave description, print its sequence number (starting with 1) followed by its oil capacity. Approximate the oil capacity by the area within the given cross-section that may contain oil, rounded to the nearest integer. Use the format in the example output given below.
Place a blank line after each test case.
Sample Input
4
10 0 0
5 10 1
0 20 0
-10 0 0
11
0 6 0
1 5 1
6 0 0
10 4 0
8 6 0
6 4 0
4 6 0
8 10 0
10 8 0
12 10 0
8 14 1
0
Output for the Sample Input
Cave 1: Oil capacity = 150
Cave 2: Oil capacity = 27