結果
問題 | No.351 市松スライドパズル |
ユーザー | ぴろず |
提出日時 | 2016-04-15 14:50:16 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 198 ms / 2,000 ms |
コード長 | 4,209 bytes |
コンパイル時間 | 3,194 ms |
コンパイル使用メモリ | 77,912 KB |
実行使用メモリ | 50,592 KB |
最終ジャッジ日時 | 2024-09-25 03:00:58 |
合計ジャッジ時間 | 6,455 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 197 ms
46,720 KB |
testcase_01 | AC | 52 ms
37,068 KB |
testcase_02 | AC | 51 ms
36,852 KB |
testcase_03 | AC | 51 ms
37,032 KB |
testcase_04 | AC | 51 ms
37,072 KB |
testcase_05 | AC | 53 ms
36,932 KB |
testcase_06 | AC | 52 ms
36,896 KB |
testcase_07 | AC | 52 ms
37,068 KB |
testcase_08 | AC | 54 ms
37,084 KB |
testcase_09 | AC | 52 ms
36,808 KB |
testcase_10 | AC | 50 ms
36,812 KB |
testcase_11 | AC | 55 ms
37,180 KB |
testcase_12 | AC | 52 ms
37,060 KB |
testcase_13 | AC | 196 ms
50,592 KB |
testcase_14 | AC | 198 ms
46,532 KB |
testcase_15 | AC | 198 ms
46,800 KB |
testcase_16 | AC | 198 ms
46,692 KB |
testcase_17 | AC | 197 ms
46,780 KB |
testcase_18 | AC | 196 ms
46,720 KB |
testcase_19 | AC | 196 ms
46,600 KB |
testcase_20 | AC | 197 ms
46,580 KB |
ソースコード
package no351; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) { IO io = new IO(); int h = io.nextInt(); int w = io.nextInt(); int n = io.nextInt(); char[] s = new char[n]; int[] k = new int[n]; for(int i=0;i<n;i++) { s[i] = io.nextChar(); k[i] = io.nextInt(); } int ci = 0, cj = 0; for(int i=n-1;i>=0;i--) { if (s[i] == 'R') { if (ci == k[i]) { cj = (cj + w - 1) % w; } }else{ if (cj == k[i]) { ci = (ci + h - 1) % h; } } } System.out.println((ci+cj)%2==0?"white":"black"); } } class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;} public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try {in.close();} catch (IOException e) {}} }