結果
問題 | No.1236 長針と短針 |
ユーザー | shojin_pro |
提出日時 | 2020-09-25 22:25:41 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,897 bytes |
コンパイル時間 | 2,161 ms |
コンパイル使用メモリ | 75,212 KB |
実行使用メモリ | 50,084 KB |
最終ジャッジ日時 | 2023-09-10 15:41:05 |
合計ジャッジ時間 | 4,253 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,612 KB |
testcase_01 | AC | 45 ms
49,508 KB |
testcase_02 | AC | 44 ms
49,580 KB |
testcase_03 | WA | - |
testcase_04 | AC | 45 ms
49,972 KB |
testcase_05 | AC | 44 ms
49,584 KB |
testcase_06 | AC | 45 ms
49,784 KB |
testcase_07 | AC | 45 ms
49,496 KB |
testcase_08 | AC | 44 ms
49,680 KB |
testcase_09 | AC | 45 ms
49,592 KB |
testcase_10 | AC | 44 ms
49,772 KB |
testcase_11 | AC | 44 ms
49,520 KB |
testcase_12 | AC | 44 ms
49,496 KB |
testcase_13 | AC | 44 ms
49,520 KB |
testcase_14 | AC | 44 ms
49,528 KB |
testcase_15 | AC | 45 ms
49,624 KB |
testcase_16 | AC | 45 ms
49,588 KB |
testcase_17 | AC | 44 ms
49,612 KB |
testcase_18 | AC | 43 ms
49,632 KB |
testcase_19 | AC | 44 ms
49,472 KB |
testcase_20 | AC | 45 ms
50,084 KB |
testcase_21 | AC | 45 ms
49,572 KB |
testcase_22 | AC | 45 ms
49,480 KB |
ソースコード
import java.util.*; import java.io.*; public class Main {; public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); StringBuilder sb = new StringBuilder(); int a = sc.nextInt(); int b = sc.nextInt(); double h = ((a%12)/12d+b/720d)%1; double m = (b/60d)%1; int ans = 0; if(h >= m){ ans = (int)((h-m)*360d/5.5d*60d); }else{ int nextH = (a+1)%12; ans += (60-b)*60; int rem = (int)((nextH*1800d+0.05d)/5.5d); ans += rem; } pw.println(ans); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } 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; } }