結果
問題 | No.281 門松と魔法(1) |
ユーザー | uafr_cs |
提出日時 | 2015-12-04 02:45:39 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,042 bytes |
コンパイル時間 | 2,013 ms |
コンパイル使用メモリ | 78,172 KB |
実行使用メモリ | 41,576 KB |
最終ジャッジ日時 | 2024-04-24 11:58:48 |
合計ジャッジ時間 | 9,635 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 115 ms
41,124 KB |
testcase_01 | AC | 101 ms
40,412 KB |
testcase_02 | AC | 99 ms
40,032 KB |
testcase_03 | AC | 100 ms
40,064 KB |
testcase_04 | AC | 100 ms
40,304 KB |
testcase_05 | AC | 112 ms
41,324 KB |
testcase_06 | AC | 101 ms
40,220 KB |
testcase_07 | AC | 110 ms
41,452 KB |
testcase_08 | AC | 124 ms
41,412 KB |
testcase_09 | AC | 112 ms
41,164 KB |
testcase_10 | AC | 99 ms
40,100 KB |
testcase_11 | AC | 109 ms
41,484 KB |
testcase_12 | AC | 95 ms
39,832 KB |
testcase_13 | AC | 101 ms
40,288 KB |
testcase_14 | AC | 109 ms
41,316 KB |
testcase_15 | AC | 97 ms
40,104 KB |
testcase_16 | AC | 98 ms
40,000 KB |
testcase_17 | WA | - |
testcase_18 | AC | 111 ms
41,376 KB |
testcase_19 | AC | 108 ms
40,996 KB |
testcase_20 | AC | 111 ms
41,040 KB |
testcase_21 | AC | 104 ms
40,816 KB |
testcase_22 | AC | 112 ms
41,188 KB |
testcase_23 | WA | - |
testcase_24 | AC | 110 ms
41,324 KB |
testcase_25 | AC | 112 ms
41,044 KB |
testcase_26 | AC | 101 ms
40,252 KB |
testcase_27 | AC | 111 ms
41,548 KB |
testcase_28 | AC | 112 ms
41,408 KB |
testcase_29 | AC | 115 ms
41,436 KB |
testcase_30 | AC | 115 ms
41,500 KB |
testcase_31 | AC | 116 ms
41,164 KB |
testcase_32 | AC | 115 ms
41,248 KB |
testcase_33 | AC | 108 ms
41,368 KB |
testcase_34 | AC | 113 ms
41,404 KB |
testcase_35 | AC | 111 ms
41,300 KB |
testcase_36 | AC | 109 ms
41,424 KB |
testcase_37 | AC | 113 ms
41,308 KB |
testcase_38 | WA | - |
testcase_39 | AC | 112 ms
41,268 KB |
testcase_40 | AC | 115 ms
40,900 KB |
testcase_41 | AC | 104 ms
40,652 KB |
testcase_42 | AC | 99 ms
40,172 KB |
testcase_43 | AC | 105 ms
40,192 KB |
testcase_44 | AC | 103 ms
40,028 KB |
testcase_45 | AC | 101 ms
40,344 KB |
testcase_46 | AC | 115 ms
41,364 KB |
testcase_47 | AC | 99 ms
40,384 KB |
testcase_48 | AC | 111 ms
41,576 KB |
testcase_49 | AC | 114 ms
41,220 KB |
testcase_50 | AC | 112 ms
41,384 KB |
testcase_51 | AC | 113 ms
41,420 KB |
testcase_52 | AC | 115 ms
41,500 KB |
testcase_53 | AC | 111 ms
41,108 KB |
testcase_54 | AC | 103 ms
40,428 KB |
testcase_55 | WA | - |
testcase_56 | AC | 101 ms
40,228 KB |
ソースコード
import java.util.Arrays; import java.util.HashSet; import java.util.LinkedList; import java.util.Scanner; import java.util.Set; public class Main { public static boolean is_valid(final long h1, final long h2, final long h3){ return ((h1 < h2 && h2 > h3) || (h1 > h2 && h2 < h3)) && (h1 != h3); } public static long d(final long h, final long d){ return Math.max(0, h - d); } public static long d(final long h_max, final long h_min, final long d){ return h_max < h_min ? 0 : (h_max - h_min) / d + 1; } public static long all_same(final long h, final long d){ return h > d ? 3 : -1; } public static long two_same(final long h1, final long h2, final long h3, final long d){ if(h1 == h2 && h2 < h3){ return is_valid(h1, d(h2, d), h3) ? 1 : -1; } if(h1 > h2 && h2 == h3){ return is_valid(h1, d(h2, d), h3) ? 1 : -1; } if(h1 == h2 && h2 > h3){ if(is_valid(d(h1, d), h2, h3)){ // d(h1) < h2 && h2 > h3 return 1; } final long h2_count = d(h2, h3, d); final long d_h2 = h2 - d * h2_count; if(is_valid(h1, d_h2, h3)){ return h2_count; } // h1 > d(h2) && d(h2) < h3 else{ return -1; } } if(h1 < h2 && h2 == h3){ if(is_valid(h1, h2, d(h3, d))){ return 1; } final long h2_count = d(h2, h1, d); final long d_h2 = Math.max(0, h2 - d * h2_count); if(is_valid(h1, d_h2, h3)){ return h2_count; } else { return -1; } } if(h1 == h3 && h1 < h2){ return is_valid(d(h1, d), h2, h3) ? 1 : -1; } if(h1 == h3 && h1 > h2){ final long h1_count = d(h1, h2, d); final long d_h1 = Math.max(0, h1 - d * h1_count); if(d_h1 == 0){ return -1; } return h1_count * 2 + 1; } return -1; } public static long all_diff(final long h1, final long h2, final long h3, final long d){ if(h1 > h2 && h2 > h3){ final long h1_count = d(h1, h2, d); final long d_h1 = Math.max(0, h1 - d * h1_count); if(is_valid(d_h1, h2, h3)){ return h1_count; }else{ return two_same(d_h1, h2, h3, d); } } if(h1 < h2 && h2 < h3){ final long h3_count = d(h3, h2, d); final long d_h3 = Math.max(0, h3 - d * h3_count); //System.out.println(d_h3); if(is_valid(h1, h2, d_h3)){ return h3_count; }else{ return two_same(h1, h2, d_h3, d); } } return -1; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); final long d = sc.nextLong(); long h1 = sc.nextLong(); long h2 = sc.nextLong(); long h3 = sc.nextLong(); if(is_valid(h1, h2, h3)){ System.out.println(0); return; }else if(d == 0){ System.out.println(-1); return; } final long max = Math.max(h1, Math.max(h2, h3)); final long min = Math.min(h1, Math.min(h2, h3)); final long med = (h1 + h2 + h3) - (max + min); //System.out.println(max + " " + min + " " + med); if(max == min){ System.out.println(all_same(max, d)); }else if(max == med || min == med){ System.out.println(two_same(h1, h2, h3, d)); }else{ System.out.println(all_diff(h1, h2, h3, d)); } } }