結果
問題 | No.1330 Multiply or Divide |
ユーザー | watarimaycry2 |
提出日時 | 2021-01-08 22:09:00 |
言語 | Java21 (openjdk 21) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,555 bytes |
コンパイル時間 | 3,522 ms |
コンパイル使用メモリ | 80,608 KB |
実行使用メモリ | 63,060 KB |
最終ジャッジ日時 | 2024-11-16 18:23:52 |
合計ジャッジ時間 | 12,855 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 296 ms
59,864 KB |
testcase_02 | AC | 48 ms
37,108 KB |
testcase_03 | AC | 49 ms
36,996 KB |
testcase_04 | AC | 51 ms
36,740 KB |
testcase_05 | AC | 47 ms
36,988 KB |
testcase_06 | AC | 240 ms
60,312 KB |
testcase_07 | AC | 881 ms
60,296 KB |
testcase_08 | AC | 309 ms
62,156 KB |
testcase_09 | AC | 318 ms
62,412 KB |
testcase_10 | AC | 306 ms
62,140 KB |
testcase_11 | AC | 346 ms
62,984 KB |
testcase_12 | AC | 321 ms
62,368 KB |
testcase_13 | AC | 49 ms
36,920 KB |
testcase_14 | AC | 48 ms
37,104 KB |
testcase_15 | AC | 45 ms
36,956 KB |
testcase_16 | AC | 44 ms
36,844 KB |
testcase_17 | AC | 45 ms
37,064 KB |
testcase_18 | AC | 254 ms
62,436 KB |
testcase_19 | AC | 244 ms
62,272 KB |
testcase_20 | AC | 254 ms
62,088 KB |
testcase_21 | AC | 258 ms
62,088 KB |
testcase_22 | AC | 256 ms
61,960 KB |
testcase_23 | AC | 324 ms
63,060 KB |
testcase_24 | AC | 47 ms
36,776 KB |
testcase_25 | AC | 44 ms
37,056 KB |
testcase_26 | AC | 45 ms
37,156 KB |
testcase_27 | AC | 44 ms
36,976 KB |
testcase_28 | AC | 45 ms
36,956 KB |
testcase_29 | AC | 45 ms
37,032 KB |
testcase_30 | AC | 44 ms
37,288 KB |
testcase_31 | AC | 44 ms
37,228 KB |
testcase_32 | AC | 45 ms
37,096 KB |
testcase_33 | AC | 47 ms
36,736 KB |
testcase_34 | AC | 211 ms
53,444 KB |
testcase_35 | AC | 113 ms
44,776 KB |
testcase_36 | AC | 206 ms
53,248 KB |
testcase_37 | AC | 203 ms
54,080 KB |
testcase_38 | AC | 152 ms
48,708 KB |
testcase_39 | AC | 123 ms
44,532 KB |
testcase_40 | AC | 142 ms
47,740 KB |
testcase_41 | AC | 99 ms
44,352 KB |
testcase_42 | AC | 215 ms
53,176 KB |
testcase_43 | AC | 197 ms
53,352 KB |
testcase_44 | AC | 396 ms
61,188 KB |
testcase_45 | AC | 461 ms
61,272 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ static void solve(){//Here is the main function int N = nextInt(); int M = nextInt(); int P = nextInt(); int[] list = new int[N]; int[] add = new int[N]; for(int i = 0; i < N; i++){ int v = nextInt(); if(v > M){ myout(1); return; } list[i] = v; } int min = 1 << 30; for(int i = 0; i < N; i++){ long v = 1; int count = 0; if(list[i] == 1){ continue; } boolean isOK = true; while(v <= M){ while(v % P == 0){ v /= P; count++; if(v == 1){ isOK = false; break; } } if(!isOK){ break; } v *= list[i]; count++; } if(isOK){ min = Math.min(min, count); } } if(min == (1 << 30)){ myout(-1); }else{ myout(min); } } //Method addition frame start //Method addition frame end }