Q. Where is a PDF?
A. PDF for Task Description is found at
http://icfpc2016.blogspot.jp/2016/08/pdf-for-task-description.html
Q. Black writing on brown background is really bad.
A. Please reload the Web page in your browser.
Q. Is it ok to register the team with incomplete list of members for now?
A. Yes, as long as you keep the conditions that one person is member of only a single team, and that teams do not divide or collaborate, you can complete the list of members after your initialization. You can edit your team profile from the contest server interface.
Q. Is the example solution specification correct? The second facet listed, 4 1 2 6 5 I believe should instead read 5 1 2 6 5.
A. Please read the facets part specification carefully.
Q. How do I use the playground tool?
A. Drag from point A to point B, and you can fold the paper at the perpendicular bisector of the two points.
Q. The playground tool does not work.
A. Please use one of the latest browsers on your computers with mouse devices. We also have (limited) touchscreen support. In any case, operation or consistency with the task description is not guaranteed.
Q. Are polygons from an input silhouette guaranteed to be simple? Or they can be of arbitrary shape even with self-intersections?
A. The boundary of a silhouette polygons does not intersect with itself. Also, it does not share a fixed-length segment with itself. However, it may touch itself at finite numbers of points.
Q. Is there guarantee that holes in an input silhouette are within some polygon from the silhouette with positive area?
A. All holes in an impute silhouette are always within other positive-area polygons.
Q. Blob Lookup API doesn't work.
A.
Your access to our server might be failing because of your network configuration. Note that the blob lookup API returns a redirect (303 See other) to storage.googleapis.com. In order to access the blob lookup API you need to be able to connect to 2016sv.icfpcontest.org and storage.googleapis.com. Please check if you can connect to them. If this is not your case, please post your question with the details (the name of the hash you can't access, the IP address you are connecting from, the error message, etc.)
Q. When a solution has to be normalized?
A. Normalized solutions are only required for problem submissions. Solutions to existing problems are not necessarily normalized, and just have to be valid.
Q. Can you increase the submission rate limit of at 1000 / hour?
A. No, this is the hard limit from our server capability and the numbers of already registered teams. In fact, we might be forced to decrease the rate limits, as precautioned in the terms and conditions.
Q. How can I possibly solve all the problems, given that already thousands of problems are submitted in a few hours?
A. Don't worry. The problem IDs you see are numbered in the order of their submissions. Some of them never get published because they are overwritten by later submissions. Since each team publish at most one problem per hour, and the number of teams is smaller than the number of submissions you can make per second, you will have enough time to solve all the problems. Also note that problem publication is closed 3 hours before the end of the contest. Plan wisely and have some good luck.
Q. What happens when I submit multiple problems to be published at the same time?
A. If you submit multiple problems with the same timestamp, the latest submission will be used. This behavior is described only in REST API Documentation, but the same applies to web interface too.
Q. Are the 1000/hour rate limits rolling 1-hour windows?
A. No, the rate limits are counters reset every hour on the hour (HH:00).
See the
Rate Limits and Leaderboard Freeze section of the task description for the detail.
