結果
問題 | No.769 UNOシミュレータ |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-03-31 02:00:06 |
言語 | D (dmd 2.106.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 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,812 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 8 ms
6,940 KB |
testcase_10 | AC | 7 ms
6,940 KB |
testcase_11 | AC | 7 ms
6,940 KB |
testcase_12 | AC | 64 ms
12,384 KB |
testcase_13 | AC | 65 ms
12,444 KB |
testcase_14 | AC | 65 ms
13,256 KB |
testcase_15 | AC | 131 ms
14,032 KB |
testcase_16 | AC | 131 ms
14,128 KB |
testcase_17 | AC | 133 ms
14,124 KB |
testcase_18 | AC | 203 ms
23,272 KB |
testcase_19 | AC | 202 ms
22,408 KB |
testcase_20 | AC | 200 ms
22,780 KB |
testcase_21 | AC | 201 ms
22,516 KB |
testcase_22 | AC | 1 ms
6,944 KB |
ソースコード
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) { } }