結果
問題 | No.1730 GCD on Blackboard in yukicoder |
ユーザー | watarimaycry2 |
提出日時 | 2023-06-24 08:40:26 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,714 bytes |
コンパイル時間 | 2,612 ms |
コンパイル使用メモリ | 81,344 KB |
実行使用メモリ | 202,152 KB |
最終ジャッジ日時 | 2024-07-01 11:58:31 |
合計ジャッジ時間 | 25,009 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 876 ms
86,432 KB |
testcase_01 | AC | 57 ms
54,404 KB |
testcase_02 | AC | 57 ms
54,644 KB |
testcase_03 | AC | 60 ms
54,776 KB |
testcase_04 | AC | 60 ms
54,688 KB |
testcase_05 | AC | 61 ms
54,680 KB |
testcase_06 | AC | 59 ms
54,644 KB |
testcase_07 | AC | 60 ms
54,232 KB |
testcase_08 | AC | 57 ms
54,328 KB |
testcase_09 | AC | 58 ms
54,416 KB |
testcase_10 | AC | 75 ms
54,744 KB |
testcase_11 | AC | 57 ms
54,736 KB |
testcase_12 | AC | 57 ms
54,620 KB |
testcase_13 | AC | 1,809 ms
162,720 KB |
testcase_14 | AC | 1,753 ms
162,660 KB |
testcase_15 | AC | 1,709 ms
162,584 KB |
testcase_16 | AC | 1,714 ms
162,676 KB |
testcase_17 | AC | 1,822 ms
163,016 KB |
testcase_18 | AC | 1,379 ms
199,320 KB |
testcase_19 | TLE | - |
testcase_20 | AC | 668 ms
88,356 KB |
testcase_21 | AC | 650 ms
88,356 KB |
testcase_22 | AC | 861 ms
86,020 KB |
testcase_23 | AC | 528 ms
85,516 KB |
testcase_24 | AC | 507 ms
85,504 KB |
testcase_25 | AC | 1,731 ms
200,576 KB |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //見なくていいよ ここから------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ try{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in, "UTF-8")); 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(Arrays.deepToString(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 StringBuilder sb = new StringBuilder(""); String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof long[]){ long[] tmp = (long[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof int[]){ int[] tmp = (int[])list; if(tmp.length == 0){ return ""; } sb.append(String.valueOf(tmp[0])); for(int i = 1; i < tmp.length; i++){ sb.append(joinString).append(String.valueOf(tmp[i])); } return sb.toString(); }else if(list instanceof ArrayList){ ArrayList tmp = (ArrayList)list; if(tmp.size() == 0){ return ""; } sb.append(tmp.get(0)); for(int i = 1; i < tmp.size(); i++){ sb.append(joinString).append(tmp.get(i)); } return sb.toString(); }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))); } static ArrayList<String> myconv(String str, String no){ return new ArrayList<String>(Arrays.asList(str.split(no))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //見なくていいよ ここまで------------------------------------------ //このコードをコンパイルするときは、「-encoding UTF-8」を指定すること static void solve(){//ここがメイン関数 int N = nextInt(); ArrayList<Integer> list = nextIntArray(N); int[] map = new int[1000007]; int[] max = new int[200007]; HashMap<Integer, ArrayList<Integer>> keep = new HashMap<>(); for(int i = 0; i < N; i++){ int A = list.get(i); ArrayList<Integer> v; if(keep.containsKey(A)){ v = keep.get(A); }else{ v = getDivisorList(A); keep.put(A, v); } for(int g : v){ map[g]++; max[map[g]] = Math.max(g, max[map[g]]); } } for(int i = N; i >= 1; i--){ myout(max[i]); } } //メソッド追加エリア ここから static ArrayList<Integer> getDivisorList(int val){ ArrayList<Integer> list = new ArrayList<>(50); for(int i = 1; i * i <= val; i++){ if(val % i == 0){ list.add(i); if(i * i != val){ list.add(val / i); } } } //Collections.sort(list); return list; } //メソッド追加エリア ここまで }