結果
問題 | No.138 化石のバージョン |
ユーザー | threepipes_s |
提出日時 | 2015-02-16 23:11:48 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,235 bytes |
コンパイル時間 | 2,176 ms |
コンパイル使用メモリ | 78,396 KB |
実行使用メモリ | 52,272 KB |
最終ジャッジ日時 | 2024-06-23 20:48:01 |
合計ジャッジ時間 | 5,226 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
50,388 KB |
testcase_01 | AC | 52 ms
50,244 KB |
testcase_02 | AC | 53 ms
49,924 KB |
testcase_03 | AC | 54 ms
50,304 KB |
testcase_04 | AC | 53 ms
50,228 KB |
testcase_05 | AC | 52 ms
50,444 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 53 ms
50,172 KB |
testcase_17 | AC | 52 ms
50,408 KB |
testcase_18 | AC | 52 ms
50,360 KB |
testcase_19 | AC | 51 ms
50,376 KB |
testcase_20 | AC | 52 ms
50,004 KB |
testcase_21 | AC | 53 ms
50,268 KB |
testcase_22 | AC | 52 ms
50,200 KB |
testcase_23 | AC | 55 ms
50,304 KB |
testcase_24 | AC | 54 ms
50,164 KB |
testcase_25 | AC | 54 ms
50,304 KB |
testcase_26 | WA | - |
testcase_27 | AC | 54 ms
50,360 KB |
testcase_28 | AC | 54 ms
50,336 KB |
testcase_29 | AC | 54 ms
50,368 KB |
testcase_30 | AC | 53 ms
50,188 KB |
testcase_31 | AC | 55 ms
50,132 KB |
testcase_32 | AC | 54 ms
50,260 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
ソースコード
import java.io.BufferedReader; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Comparator; import java.util.List; import java.util.TreeSet; public class Main { public static boolean result[]; public static int dp[][]; public static void main(String[] args) throws NumberFormatException, IOException{ ContestScanner in = new ContestScanner(); int[] a0 = new int[3]; int[] a1 = new int[3]; String line = in.nextToken(); String[] s1 = line.split("\\."); line = in.nextToken(); String[] s2 = line.split("\\."); for(int i=0; i<3; i++){ a0[i] = Integer.parseInt(s1[i]); a1[i] = Integer.parseInt(s2[i]); } for(int i=0; i<3; i++){ if(a0[i]<a1[i]){ System.out.println("NO"); return; } } System.out.println("YES"); } static int gcd(int a, int b){ return b == 0 ? a : gcd(b, a % b); } } class MyComp implements Comparator<int[]>{ public int compare(int[] a, int[] b) { return a[0] - b[0]; } } class Reverse implements Comparator<Integer>{ public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class Node{ int id; List<Node> edge = new ArrayList<Node>(); public Node(int id){ this.id = id; } public void createEdge(Node node){ edge.add(node); } } class ContestScanner{ private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename))); } public String nextToken() throws IOException{ if(line == null || line.length <= idx){ line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public long nextLong() throws IOException, NumberFormatException{ return Long.parseLong(nextToken()); } public int nextInt() throws NumberFormatException, IOException{ return (int)nextLong(); } public double nextDouble() throws NumberFormatException, IOException{ return Double.parseDouble(nextToken()); } }