6 3 4 3 1 3 2
No No Yes No No No In the beginning, the players' scores are $(3, 3, 3, 3, 3, 3)$. * Player $3$ correctly answers a question. The players' scores are now $(2, 2, 3, 2, 2, 2)$. * Player $1$ correctly answers a question. The players' scores are now $(2, 1, 2, 1, 1, 1)$. * Player $3$ correctly answers a question. The players' scores are now $(1, 0, 2, 0, 0, 0)$. * Player $2$ correctly answers a question. The players' scores are now $(0, 0, 1, -1, -1, -1)$. Players $1, 2, 4, 5$ and $6$, who have $0$ points or lower, are eliminated, and Player $3$ survives this game.
6 5 4 3 1 3 2
Yes Yes Yes Yes Yes Yes
10 13 15 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9
No No No No Yes No No No Yes No
{
"problem": {
"name": "Attack Survival",
"description": {
"content": "Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc141_c"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which...",
"is_translate": false,
"language": "English"
}
]
}