#939300 (Java21) No.2592 おでぶなおばけさん 2

提出ソース

結果

問題	No.2592 おでぶなおばけさん 2
ユーザー	shojin_pro
提出日時	2023-12-20 00:33:59
言語	Java21 (openjdk 21)
結果	WA (最新) AC (最初)
実行時間	-
コード長	4,800 bytes
コンパイル時間	2,391 ms
コンパイル使用メモリ	79,808 KB
実行使用メモリ	66,432 KB
最終ジャッジ日時	2024-09-27 09:37:52
合計ジャッジ時間	46,857 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	52 ms 50,504 KB
testcase_01	AC	257 ms 56,004 KB
testcase_02	AC	347 ms 58,324 KB
testcase_03	AC	215 ms 55,896 KB
testcase_04	AC	234 ms 56,056 KB
testcase_05	AC	368 ms 58,768 KB
testcase_06	AC	351 ms 57,244 KB
testcase_07	AC	384 ms 59,904 KB
testcase_08	AC	351 ms 59,080 KB
testcase_09	AC	226 ms 56,176 KB
testcase_10	AC	271 ms 57,808 KB
testcase_11	AC	352 ms 56,604 KB
testcase_12	AC	204 ms 56,220 KB
testcase_13	AC	497 ms 63,620 KB
testcase_14	AC	475 ms 63,580 KB
testcase_15	AC	439 ms 60,064 KB
testcase_16	AC	494 ms 62,220 KB
testcase_17	AC	491 ms 62,592 KB
testcase_18	AC	480 ms 63,712 KB
testcase_19	AC	456 ms 60,116 KB
testcase_20	AC	442 ms 61,484 KB
testcase_21	AC	382 ms 59,316 KB
testcase_22	AC	437 ms 59,632 KB
testcase_23	AC	503 ms 63,656 KB
testcase_24	AC	499 ms 63,784 KB
testcase_25	AC	447 ms 61,416 KB
testcase_26	AC	429 ms 61,632 KB
testcase_27	AC	524 ms 66,024 KB
testcase_28	AC	520 ms 66,032 KB
testcase_29	AC	539 ms 66,416 KB
testcase_30	AC	522 ms 66,432 KB
testcase_31	AC	528 ms 65,600 KB
testcase_32	AC	540 ms 65,576 KB
testcase_33	AC	540 ms 65,668 KB
testcase_34	AC	535 ms 65,796 KB
testcase_35	AC	521 ms 65,620 KB
testcase_36	AC	544 ms 65,724 KB
testcase_37	AC	525 ms 65,640 KB
testcase_38	AC	564 ms 65,688 KB
testcase_39	AC	546 ms 65,700 KB
testcase_40	AC	527 ms 65,820 KB
testcase_41	AC	530 ms 65,584 KB
testcase_42	AC	527 ms 65,560 KB
testcase_43	AC	516 ms 65,700 KB
testcase_44	AC	520 ms 65,696 KB
testcase_45	AC	546 ms 65,528 KB
testcase_46	AC	514 ms 65,596 KB
testcase_47	AC	533 ms 63,304 KB
testcase_48	AC	487 ms 63,800 KB
testcase_49	AC	493 ms 63,384 KB
testcase_50	AC	506 ms 63,140 KB
testcase_51	AC	501 ms 63,652 KB
testcase_52	AC	546 ms 65,744 KB
testcase_53	AC	516 ms 65,580 KB
testcase_54	AC	514 ms 65,640 KB
testcase_55	AC	535 ms 65,648 KB
testcase_56	AC	509 ms 65,516 KB
testcase_57	AC	261 ms 57,488 KB
testcase_58	AC	541 ms 65,648 KB
testcase_59	AC	579 ms 65,700 KB
testcase_60	AC	543 ms 65,792 KB
testcase_61	AC	529 ms 66,000 KB
testcase_62	AC	547 ms 65,832 KB
testcase_63	AC	511 ms 65,468 KB
testcase_64	AC	504 ms 65,680 KB
testcase_65	AC	515 ms 65,288 KB
testcase_66	AC	527 ms 65,444 KB
testcase_67	AC	534 ms 65,288 KB
testcase_68	AC	543 ms 65,496 KB
testcase_69	AC	520 ms 65,280 KB
testcase_70	AC	528 ms 65,440 KB
testcase_71	AC	531 ms 65,316 KB
testcase_72	AC	555 ms 65,532 KB
testcase_73	AC	545 ms 65,316 KB
testcase_74	WA	-
testcase_75	AC	536 ms 65,604 KB
testcase_76	AC	520 ms 65,800 KB
testcase_77	AC	547 ms 65,624 KB
testcase_78	AC	521 ms 65,500 KB
testcase_79	AC	526 ms 65,652 KB
testcase_80	AC	519 ms 65,544 KB
testcase_81	AC	536 ms 65,600 KB
testcase_82	AC	501 ms 65,612 KB
testcase_83	AC	506 ms 65,572 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.util.*;
import java.io.*;

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long)1e9+7;
    static long mod3 = (long)1e9+9;
    static long mod2 = 998244353;

    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }
    
    public static void solve(){
        int N = sc.nextInt();
        int Q = sc.nextInt();
        long K = sc.nextLong();
        long[] A = sc.nextLongArray(N);
        ArrayList<int[]> Query = new ArrayList<>();
        for(int i = 0; i < Q; i++){
            Query.add(new int[]{sc.nextInt(),sc.nextInt()});
        }
        boolean[] check1 = check(A,Query,K,mod,N);
        boolean[] check2 = check(A,Query,K,mod2,N);
        boolean[] check3 = check(A,Query,K,mod3,N);
        for(int i = 0; i < Q; i++){
            if(check1[i] || check2[i] || check3[i]){
                pw.println("Yes");
            }else{
                pw.println("No");
            }
        }
    }
    
    static boolean[] check(long[] A, ArrayList<int[]> Query, long K, long mod, int N){
        int Q = Query.size();
        boolean[] ret = new boolean[Q];
        K %= mod;
        long[] sum = new long[N+1];
        long now = 1;
        for(int i = 0; i < N; i++){
            long v = A[i];
            if(v < 0){
                long p = (Math.abs(v)+mod-1)/mod;
                v += p*mod;
                v %= mod;
            }else{
                v %= mod;
            }
            sum[i+1] += (sum[i]+(v*now))%mod;
            now *= K;
            now %= mod;
        }
        for(int i = 0; i < Q; i++){
            int l = Query.get(i)[0]-1;
            int r = Query.get(i)[1];
            if(sum[r] - sum[l] != 0){
                ret[i] = true;
            }else{
                ret[i] = false;
            }
        }
        return ret;
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}

yukicoder

結果

テストケース

ソースコード