結果
問題 | No.1330 Multiply or Divide |
ユーザー | watarimaycry2 |
提出日時 | 2021-01-08 22:06:16 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,651 bytes |
コンパイル時間 | 2,445 ms |
コンパイル使用メモリ | 80,412 KB |
実行使用メモリ | 73,980 KB |
最終ジャッジ日時 | 2024-04-28 03:12:51 |
合計ジャッジ時間 | 11,652 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 333 ms
70,644 KB |
testcase_02 | AC | 44 ms
37,056 KB |
testcase_03 | AC | 46 ms
37,512 KB |
testcase_04 | AC | 47 ms
37,448 KB |
testcase_05 | AC | 46 ms
37,604 KB |
testcase_06 | AC | 229 ms
60,884 KB |
testcase_07 | WA | - |
testcase_08 | AC | 315 ms
62,688 KB |
testcase_09 | AC | 317 ms
72,264 KB |
testcase_10 | AC | 312 ms
62,908 KB |
testcase_11 | AC | 308 ms
72,392 KB |
testcase_12 | AC | 313 ms
62,692 KB |
testcase_13 | AC | 48 ms
50,504 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 47 ms
50,680 KB |
testcase_17 | WA | - |
testcase_18 | AC | 272 ms
62,056 KB |
testcase_19 | AC | 261 ms
71,600 KB |
testcase_20 | AC | 274 ms
63,200 KB |
testcase_21 | AC | 259 ms
71,708 KB |
testcase_22 | AC | 248 ms
62,344 KB |
testcase_23 | AC | 323 ms
73,284 KB |
testcase_24 | AC | 46 ms
37,464 KB |
testcase_25 | AC | 46 ms
37,188 KB |
testcase_26 | AC | 47 ms
37,056 KB |
testcase_27 | AC | 47 ms
37,476 KB |
testcase_28 | AC | 45 ms
37,180 KB |
testcase_29 | AC | 44 ms
37,604 KB |
testcase_30 | AC | 45 ms
37,240 KB |
testcase_31 | AC | 45 ms
37,512 KB |
testcase_32 | AC | 44 ms
37,504 KB |
testcase_33 | AC | 46 ms
37,292 KB |
testcase_34 | AC | 213 ms
53,836 KB |
testcase_35 | AC | 117 ms
44,900 KB |
testcase_36 | AC | 212 ms
54,540 KB |
testcase_37 | AC | 202 ms
54,064 KB |
testcase_38 | AC | 151 ms
49,204 KB |
testcase_39 | AC | 127 ms
45,100 KB |
testcase_40 | AC | 141 ms
47,908 KB |
testcase_41 | AC | 106 ms
44,772 KB |
testcase_42 | AC | 198 ms
53,972 KB |
testcase_43 | AC | 205 ms
54,500 KB |
testcase_44 | WA | - |
testcase_45 | WA | - |
ソースコード
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; } int check = 0; while(v % P == 0){ v /= P; check++; } list[i] = v; add[i] = check; } 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; if(v == 1){ isOK = false; break; } } if(!isOK){ break; } v *= list[i]; count++; count += add[i]; } if(isOK){ min = Math.min(min, count); } } if(min == (1 << 30)){ myout(-1); }else{ myout(min); } } //Method addition frame start //Method addition frame end }