結果
問題 | No.769 UNOシミュレータ |
ユーザー |
![]() |
提出日時 | 2018-12-17 03:06:48 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 487 ms / 2,000 ms |
コード長 | 3,415 bytes |
コンパイル時間 | 2,555 ms |
コンパイル使用メモリ | 88,996 KB |
実行使用メモリ | 75,892 KB |
最終ジャッジ日時 | 2024-11-22 08:47:02 |
合計ジャッジ時間 | 9,359 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
public class Main {private static void solve() {int n = ni();int m = ni();String[] l = new String[m];int dir = 1;int now = 0;int[] num = new int[n];for (int i = 0; i < m; i ++) {l[i] = next();}int d2 = 0;int d4 = 0;int last = 0;for (int i = 0; i < m; i ++) {if (l[i].equals("drawtwo")) {d2 ++;} else if (l[i].equals("drawfour")) {d4 ++;} else if (l[i].equals("reverse")) {dir = -dir;}last = now + 1;num[now] --;now = (now + dir + n) % n;if (l[i].equals("skip")) {now = (now + dir + n) % n;} else if (i < m - 1 && l[i].equals("drawfour") && !l[i + 1].equals("drawfour")) {num[now] += d4 * 4;d4 = 0;now = (now + dir + n) % n;} else if (i < m - 1 && l[i].equals("drawtwo") && !l[i + 1].equals("drawtwo")) {num[now] += d2 * 2;d2 = 0;now = (now + dir + n) % n;}}System.out.println(last + " " + -num[last - 1]);}public static void main(String[] args) {new Thread(null, new Runnable() {@Overridepublic void run() {long start = System.currentTimeMillis();String debug = args.length > 0 ? args[0] : null;if (debug != null) {try {is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));} catch (Exception e) {throw new RuntimeException(e);}}reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);solve();out.flush();tr((System.currentTimeMillis() - start) + "ms");}}, "", 64000000).start();}private static java.io.InputStream is = System.in;private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);private static java.util.StringTokenizer tokenizer = null;private static java.io.BufferedReader reader;public static String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {try {tokenizer = new java.util.StringTokenizer(reader.readLine());} catch (Exception e) {throw new RuntimeException(e);}}return tokenizer.nextToken();}private static double nd() {return Double.parseDouble(next());}private static long nl() {return Long.parseLong(next());}private static int[] na(int n) {int[] a = new int[n];for (int i = 0; i < n; i++)a[i] = ni();return a;}private static char[] ns() {return next().toCharArray();}private static long[] nal(int n) {long[] a = new long[n];for (int i = 0; i < n; i++)a[i] = nl();return a;}private static int[][] ntable(int n, int m) {int[][] table = new int[n][m];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[i][j] = ni();}}return table;}private static int[][] nlist(int n, int m) {int[][] table = new int[m][n];for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) {table[j][i] = ni();}}return table;}private static int ni() {return Integer.parseInt(next());}private static void tr(Object... o) {if (is != System.in)System.out.println(java.util.Arrays.deepToString(o));}}