提出 #71146735


ソースコード 拡げる

import java.io.IOException;
import java.io.InputStream;
import java.util.HashMap;
import java.util.NoSuchElementException;

class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();

        int N = sc.nextInt();
        long M = sc.nextInt();
        long[] A = new long[N];
        int[] keta = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();

            long a = A[i];
            keta[i] = 1;
            for (int j = 0; j < 12; j++) {
                if (a / 10 != 0){
                    keta[i]++;
                    a /= 10;
                }
            }
        }

        long[] ketaM = new long[12];
        for (int i = 0; i < 12; i++) {
            ketaM[i] = 1;
            for (int j = 0; j < i; j++) {
                ketaM[i] *= 10;
            }
            ketaM[i] %= M;
        }

        HashMap<Long,Integer>[] map = new HashMap[12];
        for (int i = 0; i < 12; i++) {
            map[i] = new HashMap<>();
        }
        for (int i = 0; i < N; i++) {
            map[keta[i]].putIfAbsent(A[i]%M,0);
            map[keta[i]].put(A[i]%M,map[keta[i]].get(A[i]%M) + 1);
        }

        long answer = 0;
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < 12; j++) {
                map[j].putIfAbsent((M - (ketaM[j]*A[i]%M)%M)%M,0);
                answer += map[j].get((M - (ketaM[j]*A[i]%M)%M)%M);
            }
        }

        System.out.println(answer);

        MyWriter.flush();
    }

    private static class MyWriter{
        static StringBuilder sb = new StringBuilder();
        protected static void flush(){
            System.out.print(sb);
            sb = new StringBuilder();
        }
        protected static void println(){
            sb.append("\n");
        }
        protected static void println(int i){
            sb.append(i).append("\n");
        }
        protected static void println(long l) {
            sb.append(l).append("\n");
        }
        protected static void println(double d) {
            sb.append(d).append("\n");
        }
        protected static void println(float f) {
            sb.append(f).append("\n");
        }
        protected static void println(char c) {
            sb.append(c).append("\n");
        }
        protected static void println(boolean b) {
            sb.append(b).append("\n");
        }
        protected static void println(Object obj) {
            String s = String.valueOf(obj);
            sb.append(s).append("\n");
        }
        protected static void print(int i){
            sb.append(i);
        }
        protected static void print(long l) {
            sb.append(l);
        }
        protected static void print(double d) {
            sb.append(d);
        }
        protected static void print(float f) {
            sb.append(f);
        }
        protected static void print(char c) {
            sb.append(c);
        }
        protected static void print(boolean b) {
            sb.append(b);
        }
        protected static void print(Object obj) {
            String s = String.valueOf(obj);
            sb.append(s);
        }

        protected static void printInv(long a,long b,long MOD){
            a %= MOD;
            b %= MOD;
            println((a * invGcd(b,MOD)[1])%MOD);
        }
        private static long safeMod(long x, long m){
            x %= m;
            if(x<0) x += m;
            return x;
        }
        private static long[] invGcd(long a, long b){
            a = safeMod(a, b);
            if(a==0) return new long[]{b,0};

            long s=b, t=a;
            long m0=0, m1=1;
            while(t>0){
                long u = s/t;
                s -= t*u;
                m0 -= m1*u;
                long tmp = s; s = t; t = tmp;
                tmp = m0; m0 = m1; m1 = tmp;
            }
            if(m0<0) m0 += b/s;
            return new long[]{s,m0};
        }
        public static long writerGcd(long... a){
            if(a.length == 0) return 0;
            long r = Math.abs(a[0]);
            for(int i=1; i<a.length; i++){
                if(a[i]!=0) {
                    if(r==0) r = Math.abs(a[i]);
                    else r = invGcd(r, Math.abs(a[i]))[0];
                }
            }
            return r;
        }
    }

    private static class FastScanner {
        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();
                }
                return buflen > 0;
            }
        }

        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());
        }
    }
}

提出情報

提出日時
問題 D - 183183
ユーザ AAH_tomato
言語 Java24 (OpenJDK 24.0.2)
得点 400
コード長 6973 Byte
結果 AC
実行時間 1265 ms
メモリ 246016 KiB

コンパイルエラー

Note: Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 4
AC × 25
セット名 テストケース
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt
ケース名 結果 実行時間 メモリ
00_sample_00.txt AC 39 ms 38100 KiB
00_sample_01.txt AC 39 ms 37748 KiB
00_sample_02.txt AC 39 ms 37860 KiB
00_sample_03.txt AC 38 ms 37836 KiB
01_random_00.txt AC 39 ms 37920 KiB
01_random_01.txt AC 39 ms 37928 KiB
01_random_02.txt AC 38 ms 37968 KiB
01_random_03.txt AC 38 ms 37900 KiB
01_random_04.txt AC 172 ms 46132 KiB
01_random_05.txt AC 255 ms 92280 KiB
01_random_06.txt AC 149 ms 44468 KiB
01_random_07.txt AC 481 ms 129292 KiB
01_random_08.txt AC 178 ms 46904 KiB
01_random_09.txt AC 1265 ms 211624 KiB
01_random_10.txt AC 220 ms 50356 KiB
01_random_11.txt AC 1187 ms 246016 KiB
01_random_12.txt AC 184 ms 47316 KiB
01_random_13.txt AC 151 ms 65004 KiB
01_random_14.txt AC 188 ms 45900 KiB
01_random_15.txt AC 709 ms 139288 KiB
01_random_16.txt AC 160 ms 43272 KiB
01_random_17.txt AC 170 ms 67600 KiB
01_random_18.txt AC 255 ms 49116 KiB
01_random_19.txt AC 207 ms 49348 KiB
01_random_20.txt AC 111 ms 41684 KiB