結果
問題 | No.846 メダル |
ユーザー | htensai |
提出日時 | 2019-12-31 23:26:47 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 89 ms / 2,000 ms |
コード長 | 2,942 bytes |
コンパイル時間 | 2,435 ms |
コンパイル使用メモリ | 85,680 KB |
実行使用メモリ | 39,312 KB |
最終ジャッジ日時 | 2024-11-20 19:31:12 |
合計ジャッジ時間 | 5,572 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 89 ms
37,804 KB |
testcase_01 | AC | 53 ms
36,732 KB |
testcase_02 | AC | 86 ms
38,204 KB |
testcase_03 | AC | 77 ms
37,752 KB |
testcase_04 | AC | 53 ms
36,856 KB |
testcase_05 | AC | 54 ms
36,144 KB |
testcase_06 | AC | 77 ms
37,660 KB |
testcase_07 | AC | 53 ms
36,704 KB |
testcase_08 | AC | 78 ms
38,160 KB |
testcase_09 | AC | 77 ms
38,084 KB |
testcase_10 | AC | 81 ms
37,828 KB |
testcase_11 | AC | 76 ms
37,980 KB |
testcase_12 | AC | 52 ms
36,760 KB |
testcase_13 | AC | 53 ms
36,396 KB |
testcase_14 | AC | 78 ms
37,880 KB |
testcase_15 | AC | 54 ms
36,720 KB |
testcase_16 | AC | 54 ms
36,624 KB |
testcase_17 | AC | 77 ms
37,796 KB |
testcase_18 | AC | 53 ms
36,848 KB |
testcase_19 | AC | 54 ms
36,860 KB |
testcase_20 | AC | 80 ms
39,096 KB |
testcase_21 | AC | 77 ms
37,896 KB |
testcase_22 | AC | 89 ms
38,380 KB |
testcase_23 | AC | 53 ms
36,272 KB |
testcase_24 | AC | 80 ms
37,916 KB |
testcase_25 | AC | 79 ms
39,312 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(); long p = sc.nextInt(); long q = sc.nextInt(); long r = sc.nextInt(); long a = sc.nextInt(); long b = sc.nextInt(); long c = sc.nextInt(); long n1Min = (a - 1) * p + 1; long n2Min = (a + b - 1) * q + 1; long n3Min = (a + b + c - 1) * r + 1; long n1Max = a * p; long n2Max = (a + b) * q; long n3Max = (a + b + c) * r; long max = Math.min(Math.min(n1Max, n2Max), n3Max); long min = Math.max(Math.max(n1Min, n2Min), n3Min); if (max < min) { System.out.println(-1); } else { System.out.println(min + " " + max); } } } 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;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() { return Double.parseDouble(next()); } }