結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | 37zigen |
提出日時 | 2020-02-14 22:26:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 430 ms / 2,000 ms |
コード長 | 4,250 bytes |
コンパイル時間 | 2,317 ms |
コンパイル使用メモリ | 79,904 KB |
実行使用メモリ | 72,660 KB |
最終ジャッジ日時 | 2024-04-27 19:49:14 |
合計ジャッジ時間 | 6,415 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
50,060 KB |
testcase_01 | AC | 47 ms
49,948 KB |
testcase_02 | AC | 46 ms
50,036 KB |
testcase_03 | AC | 46 ms
49,804 KB |
testcase_04 | AC | 44 ms
50,028 KB |
testcase_05 | AC | 45 ms
50,028 KB |
testcase_06 | AC | 45 ms
50,156 KB |
testcase_07 | AC | 46 ms
50,280 KB |
testcase_08 | AC | 44 ms
49,916 KB |
testcase_09 | AC | 46 ms
49,992 KB |
testcase_10 | AC | 191 ms
60,600 KB |
testcase_11 | AC | 198 ms
56,160 KB |
testcase_12 | AC | 410 ms
57,000 KB |
testcase_13 | AC | 159 ms
55,620 KB |
testcase_14 | AC | 212 ms
56,224 KB |
testcase_15 | AC | 199 ms
55,172 KB |
testcase_16 | AC | 237 ms
60,512 KB |
testcase_17 | AC | 165 ms
56,620 KB |
testcase_18 | AC | 430 ms
57,812 KB |
testcase_19 | AC | 265 ms
56,216 KB |
testcase_20 | AC | 344 ms
72,660 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.NoSuchElementException; class Main { public static void main(String[] args) throws Exception { new Main().run(); } void run() { Scanner sc=new Scanner(); int N=sc.nextInt(); int M=sc.nextInt(); long K=sc.nextLong(); char op=sc.next().toCharArray()[0]; long[] A=new long[N]; long[] B=new long[M]; for(int i=0;i<M;++i)B[i]=sc.nextLong(); for(int i=0;i<N;++i)A[i]=sc.nextLong(); Arrays.sort(A); Arrays.sort(B); long ans=0; if(op=='*') { for(int i=0;i<A.length;++i)A[i]=gcd(K,A[i]); for(int i=0;i<B.length;++i)B[i]=gcd(K,B[i]); HashMap<Long,Long> ma=new HashMap<>(); HashMap<Long,Long> mb=new HashMap<>(); for(int i=0;i<B.length;++i) { if(mb.containsKey(B[i]))mb.put(B[i], mb.get(B[i])+1); else mb.put(B[i], 1L); } for(int i=0;i<A.length;++i) { if(ma.containsKey(A[i]))ma.put(A[i], ma.get(A[i])+1); else ma.put(A[i], 1L); } for(Map.Entry<Long, Long> a:ma.entrySet()) { for(Map.Entry<Long, Long> b:mb.entrySet()) { if(a.getKey()*b.getKey()%K==0) { ans+=a.getValue()*b.getValue(); } } } }else { for(int i=0;i<A.length;++i)A[i]%=K; for(int i=0;i<B.length;++i)B[i]%=K; HashMap<Long,Long> ma=new HashMap<>(); HashMap<Long,Long> mb=new HashMap<>(); for(int i=0;i<B.length;++i) { if(mb.containsKey(B[i]))mb.put(B[i], mb.get(B[i])+1); else mb.put(B[i], 1L); } for(int i=0;i<A.length;++i) { if(ma.containsKey(A[i]))ma.put(A[i], ma.get(A[i])+1); else ma.put(A[i], 1L); } for(Map.Entry<Long, Long> a:ma.entrySet()) { if(mb.containsKey((K-a.getKey())%K))ans+=mb.get((K-a.getKey())%K)*a.getValue(); } } System.out.println(ans); } long gcd(long a,long b) { return a==0?b:gcd(b%a,a); } int binarySearch(long[] a,long key) { int ok=a.length; int ng=-1; while(ok-ng>1) { int middle=(ok+ng)/2; if(a[middle]>=key)ok=middle; else ng=middle; } return ok; } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class Scanner { 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());} }