結果
問題 | No.990 N×Mマス計算(Kの倍数) |
ユーザー | Oland |
提出日時 | 2020-02-16 09:00:26 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 455 ms / 2,000 ms |
コード長 | 9,449 bytes |
コンパイル時間 | 2,442 ms |
コンパイル使用メモリ | 83,692 KB |
実行使用メモリ | 62,952 KB |
最終ジャッジ日時 | 2024-04-27 20:57:08 |
合計ジャッジ時間 | 7,350 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,548 KB |
testcase_01 | AC | 55 ms
50,256 KB |
testcase_02 | AC | 57 ms
50,404 KB |
testcase_03 | AC | 57 ms
50,512 KB |
testcase_04 | AC | 55 ms
50,548 KB |
testcase_05 | AC | 56 ms
50,340 KB |
testcase_06 | AC | 56 ms
50,424 KB |
testcase_07 | AC | 55 ms
50,236 KB |
testcase_08 | AC | 55 ms
50,588 KB |
testcase_09 | AC | 56 ms
50,488 KB |
testcase_10 | AC | 258 ms
56,932 KB |
testcase_11 | AC | 208 ms
55,544 KB |
testcase_12 | AC | 451 ms
56,296 KB |
testcase_13 | AC | 172 ms
55,596 KB |
testcase_14 | AC | 252 ms
55,984 KB |
testcase_15 | AC | 186 ms
55,588 KB |
testcase_16 | AC | 269 ms
58,644 KB |
testcase_17 | AC | 193 ms
55,444 KB |
testcase_18 | AC | 410 ms
56,488 KB |
testcase_19 | AC | 260 ms
55,936 KB |
testcase_20 | AC | 455 ms
62,952 KB |
ソースコード
import java.util.*; import java.io.*; @SuppressWarnings("unused") public class Main { FastScanner in; PrintWriter out; int MOD = (int)1e9+7; long ceil(long a, long b){return (a + b - 1) / b;} long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);} long lcm(long a, long b){return a / gcd(a, b) * b;} void solve(){ int N = in.nextInt(), M = in.nextInt(), K = in.nextInt(); char op = in.nextChar(); long[] B = in.nextLongArray(M), A = in.nextLongArray(N); if(op == '+'){ MultiSet<Long> multiSet = new MultiSet<>(); long sum = 0; for(int i = 0; i < N; i++) multiSet.add(A[i] % K); for(int i = 0; i < M; i++) sum += multiSet.count((K - B[i] % K) % K); out.println(sum); }else{ MultiSet<Long> multiSetA = new MultiSet<>(), multiSetB = new MultiSet<>(); long sum = 0; for(int i = 0; i < N; i++) multiSetA.add(gcd(K, A[i])); for(int i = 0; i < M; i++) multiSetB.add(gcd(K, B[i])); for(Map.Entry<Long, Integer> a : multiSetA.map.entrySet()){ for(Map.Entry<Long, Integer> b : multiSetB.map.entrySet()){ if((a.getKey() * b.getKey()) % K == 0) sum += (long)a.getValue() * b.getValue(); } } out.println(sum); } } class MultiSet<T extends Comparable<T>>{ TreeMap<T, Integer> map = new TreeMap<>(); int num = 0; public int add(T e){ map.put(e, map.getOrDefault(e, 0) + 1); num++; return map.get(e); } public int add(T e, int n){ map.put(e, map.getOrDefault(e, 0) + n); num += n; return map.get(e); } //要素eが集合に含まれない<=>mapにeのマッピングは存在しない public boolean remove(T e){ if(!map.containsKey(e)) return false; int c = map.get(e); if(c == 1) map.remove(e); else map.put(e, c - 1); num--; return true; } public boolean remove(T e, int n){ if(map.getOrDefault(e, 0) < n) return false; int c = map.get(e); if(c == n) map.remove(e); else map.put(e, c - n); num -= n; return true; } public boolean delete(T e){ if(!map.containsKey(e)) return false; num -= map.get(e); map.remove(e); return true; } public int count(T e){return map.getOrDefault(e, 0);} public int size(){return num;}//map.size()ではなく、集合に追加された要素数を返す public boolean isEmpty(){return map.isEmpty();} public boolean contains(T e){return map.containsKey(e);} public T lower(T e){return map.lowerKey(e);} //max(<e) public T higher(T e){return map.higherKey(e);} //min(e<) public T floor(T e){return map.floorKey(e);} //max(<=e) public T ceiling(T e){return map.ceilingKey(e);} //min(e<=) public T first(){return this.isEmpty() ? null : map.firstKey();}//min public T last(){return this.isEmpty() ? null : map.lastKey();} //max } public static void main(String[] args) { new Main().m(); } private void m() { in = new FastScanner(System.in); out = new PrintWriter(System.out); /* try { String path = "input.txt"; out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path)))); }catch (IOException e){ e.printStackTrace(); } */ solve(); out.flush(); in.close(); out.close(); } static class FastScanner { private Reader input; public FastScanner() {this(System.in);} public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} public void close() { try { this.input.close(); } catch (IOException e) { e.printStackTrace(); } } public int nextInt() {return (int) nextLong();} public long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } public double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } public char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } public String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public String nextLine() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (b != -1 && b != '\n') { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } } }