SoundHound Inc. Programming Contest 2018 -Masters Tournament-

Clarifications質問질문

Title問題名 User nameユーザ名 Question質問 Response回答 Public全体公開 Created time投稿日時 Modified time最終更新日時
Saving Snuuk climpet + Graph と同じく、制約の 1≤u_i<v_i≤10^5 は 1≤u_i<v_i≤n の誤りかと思われます そのとおりです。申し訳ありません。問題文を修正します。 For international contestants: we are sorry, we are fixing an error in the constraint: “1<=ui<vi<=10^5” -> “1<=ui<vi<=n”. Yes
+ Graph WA_TLE 1≤ui<vi≤10^5,1<=ui<vi<=nの間違いでは?(viがnをこえてもいいんですか?) そのとおりです。申し訳ありません。問題文を修正しました。

For international contestants: we are sorry, we fixed an error in the constraint: “1<=ui<vi<=10^5” -> “1<=ui<vi<=n”.
Yes
Saving Snuuk hawkomg Maybe the output should be $n$ lines instead of $n-1$? We are very sorry, you are right. There should be n lines for each i = 0, 1, ..., n-1. The English statement is being fixed. EDIT: Now the English statement is correct. Yes
Acrostic tuananh What is the maximum length of S? Sorry, the constraints are fixed in the English statement. |S| <= 1000. Yes