結果
問題 | No.769 UNOシミュレータ |
ユーザー | uwi |
提出日時 | 2018-12-16 22:09:05 |
言語 | Java21 (openjdk 21) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,799 bytes |
コンパイル時間 | 4,589 ms |
コンパイル使用メモリ | 86,720 KB |
実行使用メモリ | 60,824 KB |
最終ジャッジ日時 | 2024-11-22 08:41:21 |
合計ジャッジ時間 | 8,821 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 100 ms
52,768 KB |
testcase_01 | AC | 87 ms
51,392 KB |
testcase_02 | AC | 98 ms
51,784 KB |
testcase_03 | AC | 84 ms
51,156 KB |
testcase_04 | AC | 93 ms
51,408 KB |
testcase_05 | AC | 107 ms
38,472 KB |
testcase_06 | AC | 106 ms
39,600 KB |
testcase_07 | AC | 97 ms
39,600 KB |
testcase_08 | AC | 94 ms
38,576 KB |
testcase_09 | AC | 146 ms
42,148 KB |
testcase_10 | AC | 138 ms
41,788 KB |
testcase_11 | AC | 142 ms
42,284 KB |
testcase_12 | AC | 196 ms
49,004 KB |
testcase_13 | AC | 194 ms
49,132 KB |
testcase_14 | AC | 187 ms
48,784 KB |
testcase_15 | AC | 236 ms
54,160 KB |
testcase_16 | AC | 238 ms
53,556 KB |
testcase_17 | AC | 237 ms
53,568 KB |
testcase_18 | AC | 277 ms
59,760 KB |
testcase_19 | AC | 273 ms
59,656 KB |
testcase_20 | AC | 270 ms
60,824 KB |
testcase_21 | AC | 278 ms
59,568 KB |
testcase_22 | WA | - |
ソースコード
package adv2018; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Day17 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), Q = ni(); String[] logs = new String[Q]; for(int i = 0;i < Q;i++) { logs[i] = ns(); } int dir = 1; int cur = 0; int d2 = 0; int d4 = 0; int[] f = new int[n]; for(int i = 0;i < Q;i++) { if(d2 > 0 && !logs[i].equals("drawtwo")) { f[cur] += d2; d2 = 0; i--; }else if(d4 > 0 && !logs[i].equals("drawfour")) { f[cur] += d4; d4 = 0; i--; }else { f[cur]--; if(logs[i].equals("number")) { }else if(logs[i].equals("drawtwo")) { d2 += 2; }else if(logs[i].equals("drawfour")) { d4 += 4; }else if(logs[i].equals("skip")) { cur = (cur + dir + n) % n; }else { dir = -dir; } } if(i < Q-1) { cur = (cur + dir + n) % n; } } out.println((cur+1) + " " + (-f[cur])); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new Day17().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }