結果

問題 No.769 UNOシミュレータ
ユーザー aaaaaaiu
提出日時 2019-08-01 12:21:58
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 1,536 bytes
コンパイル時間 1,978 ms
コンパイル使用メモリ 195,508 KB
最終ジャッジ日時 2025-01-07 10:26:16
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 22 WA * 1
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin>>n>>m;
int cnt[n] {};
int drawn[n] {};
int turn = 0;
int dir = 1;
bool drawtwo = false;
bool drawfour = false;
int nextdraw = 0;
for (int i = 0; i < m; i++) {
string s;
cin >> s;
if (drawtwo) {
if (s == "drawtwo") {
cnt[turn]++;
turn = (turn + dir + n) % n;
nextdraw += 2;
continue;
} else {
drawn[turn] += nextdraw;
turn = (turn + dir + n) % n;
drawtwo = false;
nextdraw = 0;
}
} else if (drawfour) {
if (s == "drawfour") {
cnt[turn]++;
turn = (turn + dir + n) % n;
nextdraw += 4;
continue;
} else {
drawn[turn] += nextdraw;
turn = (turn + dir + n) % n;
drawfour = false;
}
}
cnt[turn]++;
if (s == "drawtwo") {
drawtwo = true;
nextdraw = 2;
} else if (s == "drawfour") {
drawfour = true;
nextdraw = 4;
} else if (s == "reverse") dir = -dir;
else if (s == "skip") turn = (turn + dir + n) % n;
turn = (turn + dir + n) % n;
}
int winner = (turn - dir + n) % n;
cout << winner + 1 << ' ' << cnt[winner] - drawn[winner] << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0