結果
問題 | No.769 UNOシミュレータ |
ユーザー |
👑 |
提出日時 | 2019-03-31 02:00:06 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 203 ms / 2,000 ms |
コード長 | 3,203 bytes |
コンパイル時間 | 968 ms |
コンパイル使用メモリ | 121,180 KB |
実行使用メモリ | 23,272 KB |
最終ジャッジ日時 | 2024-06-13 04:32:32 |
合計ジャッジ時間 | 4,364 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
import std.conv, std.functional, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }int N, M;string[] L;void main() {try {for (; ; ) {N = readInt();M = readInt();L = new string[M];foreach (i; 0 .. M) {L[i] = readToken();}auto cnt = new int[N];int pos = 0;int dir = +1;int last = -1;for (int i = 0; i < M; ++i) {switch (L[i]) {case "number": {debug {writeln("number ", pos);}++cnt[pos];last = pos;pos = (pos + dir + N) % N;} break;case "drawtwo": {int j;for (j = i; j < M && L[j] == "drawtwo"; ++j) {}foreach (k; i .. j) {debug {writeln("drawtwo ", pos);}++cnt[pos];last = pos;pos = (pos + dir + N) % N;}cnt[pos] -= 2 * (j - i);pos = (pos + dir + N) % N;i = j - 1;} break;case "drawfour": {int j;for (j = i; j < M && L[j] == "drawfour"; ++j) {}foreach (k; i .. j) {debug {writeln("drawfour ", pos);}++cnt[pos];last = pos;pos = (pos + dir + N) % N;}cnt[pos] -= 4 * (j - i);pos = (pos + dir + N) % N;i = j - 1;} break;case "skip": {debug {writeln("skip ", pos);}++cnt[pos];last = pos;pos = (pos + dir + N) % N;pos = (pos + dir + N) % N;} break;case "reverse": {debug {writeln("reverse ", pos);}++cnt[pos];last = pos;dir *= -1;pos = (pos + dir + N) % N;} break;default: assert(false);}}assert(last != -1);writeln(last + 1, " ", cnt[last]);}} catch (EOFException e) {}}