結果

問題 No.769 UNOシミュレータ
ユーザー Himatsubushin
提出日時 2019-01-04 10:30:22
言語 C#(csc)
(csc 3.9.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,038 bytes
コンパイル時間 2,608 ms
コンパイル使用メモリ 105,984 KB
実行使用メモリ 21,944 KB
最終ジャッジ日時 2024-11-22 09:06:01
合計ジャッジ時間 3,277 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22 WA * 1
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
namespace No769_UNO
{
class Program
{
static void Main(string[] args)
{
string[] argv = Console.ReadLine().Split(' ');
int n = int.Parse(argv[0]);
int m = int.Parse(argv[1]);
int[] cards = new int[n];
int turn = -1;
int direction = 1;
int drawcheck = 0;
int drawcount = 0;
for (; m > 0; m--)
{
string input = Console.ReadLine();
turn = NextTurn(turn, direction, n);
if (drawcheck == 0)
{
cards[turn]++;
switch (input)
{
case "number":
break;
case "drawtwo":
drawcheck = drawcount = 2;
break;
case "drawfour":
drawcheck = drawcount = 4;
break;
case "skip":
turn = NextTurn(turn, direction, n);
break;
case "reverse":
direction *= -1;
break;
}
}
else
{
switch (input)
{
case "number":
cards[turn] -= drawcount;
drawcheck = drawcount = 0;
turn = NextTurn(turn, direction, n);
cards[turn]++;
break;
case "drawtwo":
if (drawcheck == 2)
{
cards[turn]++;
drawcount += 2;
}
else
{
cards[turn] -= drawcount;
drawcheck = drawcount = 2;
turn = NextTurn(turn, direction, n);
cards[turn]++;
}
break;
case "drawfour":
if (drawcheck == 4)
{
cards[turn]++;
drawcount += 4;
}
else
{
cards[turn] -= drawcount;
drawcheck = drawcount = 4;
turn = NextTurn(turn, direction, n);
cards[turn]++;
}
break;
case "skip":
cards[turn] -= drawcount;
drawcheck = drawcount = 0;
turn = NextTurn(turn, direction, n);
cards[turn]++;
turn = NextTurn(turn, direction, n);
break;
case "reverse":
cards[turn] -= drawcount;
drawcheck = drawcount = 0;
turn = NextTurn(turn, direction, n);
cards[turn]++;
direction *= -1;
break;
}
}
}
Console.WriteLine((turn + 1).ToString() + " " + cards[turn].ToString());
}
private static int NextTurn(int turn, int direction, int n)
{
turn += direction;
if (turn < 0)
turn = n - 1;
if (turn >= n)
turn = 0;
return turn;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0