結果

問題 No.769 UNOシミュレータ
ユーザー k
提出日時 2020-08-26 21:32:07
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 47 ms / 2,000 ms
コード長 1,619 bytes
コンパイル時間 2,373 ms
コンパイル使用メモリ 196,856 KB
最終ジャッジ日時 2025-01-13 15:06:20
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()
const double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<string> line(m);
REP (i, m) cin >> line[i];
int cur = 0;
vector<int> in(n), out(n);
int dir = 1;
int winner = -1;
for (int i = 0; i < m; ) {
string l = line[i];
if (l == "number") {
winner = cur;
out[cur]++;
cur += dir;
cur = (cur % n + n) % n;
++i;
} else if (l == "drawtwo") {
int cnt = 0;
int j;
for (j = i; j < m && line[j] == l; j++) {
++cnt;
winner = cur;
out[cur]++;
cur += dir;
cur = (cur % n + n) % n;
}
in[cur] += 2 * cnt;
cur += dir;
cur = (cur % n + n) % n;
i = j;
} else if (l == "drawfour") {
int cnt = 0;
int j;
for (j = i; j < m && line[j] == l; j++) {
++cnt;
winner = cur;
out[cur]++;
cur += dir;
cur = (cur % n + n) % n;
}
in[cur] += 4 * cnt;
cur += dir;
cur = (cur % n + n) % n;
i = j;
} else if (l == "skip") {
winner = cur;
out[cur]++;
cur += 2 * dir;
cur = (cur % n + n) % n;
++i;
} else {
winner = cur;
out[cur]++;
dir *= -1;
cur += dir;
cur = (cur % n + n) % n;
++i;
}
}
cout << winner + 1 << " " << out[winner] - in[winner] << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0