結果
問題 | No.208 王将 |
ユーザー | nCk_cv |
提出日時 | 2016-07-03 07:25:35 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,250 bytes |
コンパイル時間 | 2,497 ms |
コンパイル使用メモリ | 77,840 KB |
実行使用メモリ | 54,460 KB |
最終ジャッジ日時 | 2024-04-20 08:29:19 |
合計ジャッジ時間 | 5,508 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 112 ms
54,296 KB |
testcase_01 | AC | 110 ms
54,324 KB |
testcase_02 | AC | 105 ms
53,148 KB |
testcase_03 | AC | 116 ms
53,824 KB |
testcase_04 | AC | 124 ms
53,948 KB |
testcase_05 | AC | 116 ms
54,088 KB |
testcase_06 | WA | - |
testcase_07 | AC | 112 ms
54,004 KB |
testcase_08 | AC | 101 ms
52,784 KB |
testcase_09 | AC | 114 ms
54,104 KB |
testcase_10 | AC | 112 ms
54,024 KB |
testcase_11 | AC | 109 ms
53,884 KB |
testcase_12 | AC | 112 ms
54,276 KB |
testcase_13 | AC | 114 ms
54,124 KB |
testcase_14 | AC | 103 ms
53,028 KB |
testcase_15 | AC | 111 ms
53,916 KB |
testcase_16 | AC | 103 ms
53,156 KB |
testcase_17 | AC | 104 ms
53,296 KB |
testcase_18 | AC | 100 ms
53,192 KB |
testcase_19 | AC | 113 ms
53,964 KB |
testcase_20 | AC | 115 ms
54,460 KB |
testcase_21 | AC | 114 ms
54,236 KB |
testcase_22 | AC | 107 ms
53,128 KB |
testcase_23 | AC | 106 ms
53,160 KB |
testcase_24 | WA | - |
ソースコード
import java.io.*; import java.math.*; import java.util.*; class Main { static int[] vy = {1,0,-1,0}; static int[] vx = {0,1,0,-1}; static long mod = 1000000007; static HashMap<String,Boolean> map = new HashMap<String,Boolean>(); public static void main(String[] args) { //FastScanner sc = new FastScanner(); Scanner sc = new Scanner(System.in); PrintWriter out = new PrintWriter(System.out); int x0 = sc.nextInt(); int y0 = sc.nextInt(); int x1 = sc.nextInt(); int y1 = sc.nextInt(); if(x0 == y0 && x1 == y1) x0 += 1; System.out.println(Math.max(x0, y0)); } static class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; 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 void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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 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() { if (!hasNext()) throw new NoSuchElementException(); int 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(); } } } }