結果
問題 | No.138 化石のバージョン |
ユーザー | suigingin |
提出日時 | 2015-01-29 23:34:55 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,365 bytes |
コンパイル時間 | 2,538 ms |
コンパイル使用メモリ | 82,384 KB |
実行使用メモリ | 56,024 KB |
最終ジャッジ日時 | 2023-09-05 08:03:54 |
合計ジャッジ時間 | 8,094 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 121 ms
55,792 KB |
testcase_01 | AC | 122 ms
55,708 KB |
testcase_02 | AC | 120 ms
55,984 KB |
testcase_03 | AC | 120 ms
55,408 KB |
testcase_04 | AC | 120 ms
53,688 KB |
testcase_05 | AC | 119 ms
55,588 KB |
testcase_06 | AC | 120 ms
55,408 KB |
testcase_07 | AC | 121 ms
55,588 KB |
testcase_08 | AC | 122 ms
55,540 KB |
testcase_09 | AC | 119 ms
55,436 KB |
testcase_10 | AC | 120 ms
55,860 KB |
testcase_11 | AC | 119 ms
55,424 KB |
testcase_12 | WA | - |
testcase_13 | AC | 124 ms
55,328 KB |
testcase_14 | AC | 120 ms
55,660 KB |
testcase_15 | AC | 119 ms
55,608 KB |
testcase_16 | AC | 118 ms
55,576 KB |
testcase_17 | AC | 118 ms
55,652 KB |
testcase_18 | AC | 119 ms
55,556 KB |
testcase_19 | AC | 120 ms
55,684 KB |
testcase_20 | WA | - |
testcase_21 | AC | 120 ms
55,616 KB |
testcase_22 | AC | 119 ms
55,444 KB |
testcase_23 | AC | 119 ms
55,580 KB |
testcase_24 | AC | 120 ms
55,680 KB |
testcase_25 | AC | 119 ms
55,412 KB |
testcase_26 | AC | 121 ms
55,460 KB |
testcase_27 | WA | - |
testcase_28 | AC | 122 ms
55,640 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 120 ms
55,604 KB |
testcase_33 | WA | - |
testcase_34 | AC | 119 ms
55,436 KB |
testcase_35 | WA | - |
ソースコード
import java.util.Arrays; import java.util.Scanner; public class Main { MyScanner sc = new MyScanner(); Scanner sc2 = new Scanner(System.in); final int MOD = 1000000007; int[] dx = { 1, 0, 0, -1 }; int[] dy = { 0, 1, -1, 0 }; void run() { String in1 = sc.next(); String in2 = sc.next(); int a1 = in1.charAt(0) - '0'; int b1 = in1.charAt(2) - '0'; int c1 = in1.charAt(4) - '0'; int a2 = in2.charAt(0) - '0'; int b2 = in2.charAt(2) - '0'; int c2 = in2.charAt(4) - '0'; boolean ok = false; if (a2 > a1) { ok = true; } else if (a2 == a1) { if (b2 > b1) { ok = true; } else if (b2 == b1) { if (c2 > c1) { ok = true; } } } System.out.println(ok ? "NO" : "YES"); } public static void main(String[] args) { new Main().run(); } void debug(Object... o) { System.out.println(Arrays.deepToString(o)); } void debug2(int[][] array) { for (int i = 0; i < array.length; i++) { for (int j = 0; j < array[i].length; j++) { System.out.print(array[i][j]); } System.out.println(); } } boolean inner(int h, int w, int limH, int limW) { return 0 <= h && h < limH && 0 <= w && w < limW; } void swap(int[] x, int a, int b) { int tmp = x[a]; x[a] = x[b]; x[b] = tmp; } // find minimum i (a[i] >= border) int lower_bound(int a[], int border) { int l = -1; int r = a.length; while (r - l > 1) { int mid = (l + r) / 2; if (border <= a[mid]) { r = mid; } else { l = mid; } } // r = l + 1 return r; } boolean palindrome(String s) { for (int i = 0; i < s.length() / 2; i++) { if (s.charAt(i) != s.charAt(s.length() - 1 - i)) { return false; } } return true; } class MyScanner { int nextInt() { try { int c = System.in.read(); while (c != '-' && (c < '0' || '9' < c)) c = System.in.read(); if (c == '-') return -nextInt(); int res = 0; do { res *= 10; res += c - '0'; c = System.in.read(); } while ('0' <= c && c <= '9'); return res; } catch (Exception e) { return -1; } } double nextDouble() { return Double.parseDouble(next()); } long nextLong() { return Long.parseLong(next()); } String next() { try { StringBuilder res = new StringBuilder(""); int c = System.in.read(); while (Character.isWhitespace(c)) c = System.in.read(); do { res.append((char) c); } while (!Character.isWhitespace(c = System.in.read())); return res.toString(); } catch (Exception e) { return null; } } int[] nextIntArray(int n) { int[] in = new int[n]; for (int i = 0; i < n; i++) { in[i] = nextInt(); } return in; } int[][] nextInt2dArray(int n, int m) { int[][] in = new int[n][m]; for (int i = 0; i < n; i++) { in[i] = nextIntArray(m); } return in; } double[] nextDoubleArray(int n) { double[] in = new double[n]; for (int i = 0; i < n; i++) { in[i] = nextDouble(); } return in; } long[] nextLongArray(int n) { long[] in = new long[n]; for (int i = 0; i < n; i++) { in[i] = nextLong(); } return in; } char[][] nextCharField(int n, int m) { char[][] in = new char[n][m]; for (int i = 0; i < n; i++) { String s = sc.next(); for (int j = 0; j < m; j++) { in[i][j] = s.charAt(j); } } return in; } } }