問題一覧 > 通常問題

No.2960 Judgement

レベル : / 実行時間制限 : 1ケース 0.777秒 / メモリ制限 : 277 MB / 標準ジャッジ問題
タグ : （AC するまで非表示） / 解いたユーザー数 124
作問者 : twitteryou / テスター : 👑 qand
お気に入りにしたユーザー ProblemId : 11523 / 自分の提出
問題文最終更新日: 2024-11-16 15:16:13
This statement was translated by AI (claude-opus-5-5, effort medium) and may contain errors or differ in nuance from the original. The original statement takes precedence. Back to the original
yukicoder contest 453 (順位表) の他の問題:

Story

I've prepared $8$ problems this time as well. I extended the time by $30$ minutes, so please read them through.

I gave up on adjusting the difficulty once things had drifted far from the intended difficulty order, but the terms of the match are the same as last time, as follows.

If the number of problems that Note solved correctly or that were found to be flawed is $6$ or more, Note wins; if it is $5$, it is a draw; if it is $4$ or fewer, Note loses.

As for drinks, letting $N$ be the number of problems you solved, please treat me to $\min(3,5-N)$ drinks. If that is negative, I'll be the one treating you.

If you lose, create a penalty icon (Christmas version) by $2024$/$12$/$24$ $23$:$59$, and use that icon until your all-perfect charts of ★ $5$ or higher increase by $7$ or your rating goes above $777+77$.

Clip Studio is free for $1$ month. The previous ones can be found by searching Pixiv for the tag $X+Y$, where $2^X -1$ is the Mersenne prime discovered this year and $Y$ is the number obtained by regarding my birthday as $8$ digits in yyyy/mm/dd format.

Note that there will be no mercy this time. Once the result is settled, you will have to go through with it.

By the way, as promised, the story is kept separate in all problems this time. So your opponent is quite likely ChatGPT. Well, you probably can't use the better paid version anyway. 　　

Since this problem is just a check of the rules, solving it does not count as $1$ problem. 　　

If I were to give just $1$ piece of advice, I haven't considered things like whether something passes only in PyPy3.

By the way, as for the content of this problem, I want you to judge the result of this match. Apparently the judge can get heavy sometimes, so I'll make the limits strict here.

Problem Statement

You are given strings $S_i(1 \leq i \leq 8)$ describing the verdicts of Note's programs.

Each $S_i(1 \leq i \leq 8)$ is one of AC, WA, RE, NoOut, NoSub.

Here, the verdicts are as follows:

  • AC means correct
  • WA means incorrect
  • RE means runtime error
  • NoOut means the problem is flawed
  • NoSub means not submitted



    • Write a program that prints Win if the number of problems that Note solved correctly or that were found to be flawed is $6$ or more, Draw if it is $5$, and Lose if it is $4$ or fewer.

    Input

    $S_1$ $S_2$ $S_3$ $S_4$ $S_5$ $S_6$ $S_7$ $S_8$

  • Each $S_i(1 \leq i \leq 8)$ is one of AC, WA, RE, NoOut, NoSub

    • Output

    Print Win if the number of problems that Note solved correctly or that were found to be flawed is $6$ or more, Draw if it is $5$, and Lose if it is $4$ or fewer.

    Sample

    Sample 1
    Input
    AC AC AC WA NoOut NoSub WA NoOut
    Output
    Draw

    The number of problems that Note solved correctly or that were found to be flawed is $5$, so print Draw.

    Sample 2
    Input
    AC WA WA AC AC AC AC AC
    Output
    Win

    Regardless of which problems were solved correctly, judge by the number of problems.

    Sample 3
    Input
    AC WA WA NoSub NoSub RE AC RE
    Output
    Lose

    提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。