Clarifications
Task Name | Username | Clarifications | Response | Public | Created time | Modified time |
---|---|---|---|---|---|---|
H - Magical Bridges | UECoders | Is Island connected? |
It is guaranteed that Islands S1, S2 and T are connected |
Yes | ||
G - Ancient Commemorative Monolith | agitsune | glyph * string *. .* possible? |
no. *.. ..* is possible. |
Yes | ||
B - Texas hold 'em | agitsune | in examples 2 and 3, are ties excluded? it seems that ties are regarded as loses. |
Please calculate probability in consideration of ties. |
Yes | ||
G - Ancient Commemorative Monolith | agitsune | > Each term in the sequence fits in a rectangular bounding box, although the boxes are not explicitly indicated for glyphs. Those bounding boxes for adjacent terms have no overlap to each other. Alice formalized the transliteration rules as follows. Does "bounding box" contain its boundary? i.e. can bounding boxes for adjacent terms touch each other? |
no read carefully Input section |
Yes | ||
G - Ancient Commemorative Monolith | agitsune | > The height of a rectangle is at least 3 and more than the maximum height of the tallest glyph. tallest glyph of glyphs contained in the rectangle or tallest glyph of all possible glyphs given in the input ? |
tallest glyph of all possible glyphs given in this dataset. |
Yes | ||
C - Median Tree | agitsune | in example 3, there are 16 edges, but m = 17 |
Sorry, modified sample3 test case. m = 17 is corret. We add the final line of the test case. 8 2 608 |
Yes | ||
cf16::002_ciel | I suppose I can submit only in C/C++/Java, right? Or OPEN participants don't have such limitation? |
The restriction was released. Contestants must submit programs written only in C++ or Java. Open participants can submit any programs. |
Yes | |||
JAG | 日本語で質問してもいいですか。 한국말로 질문해도 돼요? |
Only in English. |
Yes |