結果

問題 No.990 N×Mマス計算（Kの倍数）
ユーザー OlandOland
提出日時 2020-02-16 08:56:00
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 9,325 bytes
コンパイル時間 3,585 ms
コンパイル使用メモリ 82,220 KB
実行使用メモリ 99,516 KB
最終ジャッジ日時 2024-11-16 02:22:20
合計ジャッジ時間 14,082 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
42,576 KB
testcase_01 AC 51 ms
84,236 KB
testcase_02 AC 52 ms
42,408 KB
testcase_03 AC 53 ms
37,344 KB
testcase_04 AC 53 ms
37,068 KB
testcase_05 AC 54 ms
37,388 KB
testcase_06 AC 54 ms
37,328 KB
testcase_07 AC 54 ms
36,936 KB
testcase_08 AC 53 ms
37,216 KB
testcase_09 AC 53 ms
37,316 KB
testcase_10 AC 259 ms
45,944 KB
testcase_11 AC 217 ms
45,024 KB
testcase_12 TLE -
testcase_13 AC 182 ms
43,392 KB
testcase_14 AC 243 ms
45,160 KB
testcase_15 AC 189 ms
42,180 KB
testcase_16 AC 282 ms
47,772 KB
testcase_17 AC 194 ms
42,484 KB
testcase_18 TLE -
testcase_19 AC 811 ms
44,024 KB
testcase_20 AC 472 ms
99,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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> multiSet = new MultiSet<>();
            long sum = 0;
            for(int i = 0; i < N; i++) multiSet.add(gcd(K, A[i]));
            for(int i = 0; i < M; i++){
                long v = gcd(K, B[i]);
                for(Map.Entry<Long, Integer> e : multiSet.map.entrySet()){
                    if((e.getKey() * v) % K == 0) sum += e.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;
        }
    }
}
0