結果

問題 No.2592 おでぶなおばけさん 2
ユーザー shojin_proshojin_pro
提出日時 2023-12-20 17:59:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 658 ms / 2,500 ms
コード長 4,899 bytes
コンパイル時間 2,837 ms
コンパイル使用メモリ 79,960 KB
実行使用メモリ 70,000 KB
最終ジャッジ日時 2023-12-20 18:00:42
合計ジャッジ時間 56,253 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
53,880 KB
testcase_01 AC 274 ms
60,096 KB
testcase_02 AC 391 ms
62,956 KB
testcase_03 AC 235 ms
59,484 KB
testcase_04 AC 289 ms
59,748 KB
testcase_05 AC 422 ms
62,112 KB
testcase_06 AC 405 ms
61,136 KB
testcase_07 AC 446 ms
63,760 KB
testcase_08 AC 395 ms
62,584 KB
testcase_09 AC 253 ms
59,700 KB
testcase_10 AC 318 ms
61,744 KB
testcase_11 AC 390 ms
62,372 KB
testcase_12 AC 213 ms
57,448 KB
testcase_13 AC 550 ms
65,824 KB
testcase_14 AC 581 ms
67,220 KB
testcase_15 AC 509 ms
67,256 KB
testcase_16 AC 546 ms
65,680 KB
testcase_17 AC 567 ms
65,768 KB
testcase_18 AC 506 ms
67,104 KB
testcase_19 AC 502 ms
63,804 KB
testcase_20 AC 511 ms
65,064 KB
testcase_21 AC 506 ms
64,960 KB
testcase_22 AC 463 ms
63,336 KB
testcase_23 AC 570 ms
66,824 KB
testcase_24 AC 548 ms
66,308 KB
testcase_25 AC 465 ms
63,688 KB
testcase_26 AC 482 ms
63,688 KB
testcase_27 AC 605 ms
69,812 KB
testcase_28 AC 595 ms
69,880 KB
testcase_29 AC 618 ms
68,432 KB
testcase_30 AC 602 ms
70,000 KB
testcase_31 AC 632 ms
69,872 KB
testcase_32 AC 614 ms
68,036 KB
testcase_33 AC 609 ms
69,712 KB
testcase_34 AC 628 ms
69,768 KB
testcase_35 AC 609 ms
69,892 KB
testcase_36 AC 616 ms
69,752 KB
testcase_37 AC 620 ms
67,808 KB
testcase_38 AC 622 ms
69,896 KB
testcase_39 AC 629 ms
67,936 KB
testcase_40 AC 641 ms
69,748 KB
testcase_41 AC 623 ms
69,804 KB
testcase_42 AC 614 ms
69,768 KB
testcase_43 AC 632 ms
69,748 KB
testcase_44 AC 606 ms
69,776 KB
testcase_45 AC 615 ms
69,888 KB
testcase_46 AC 599 ms
69,856 KB
testcase_47 AC 565 ms
66,908 KB
testcase_48 AC 570 ms
67,048 KB
testcase_49 AC 558 ms
66,952 KB
testcase_50 AC 552 ms
67,264 KB
testcase_51 AC 544 ms
67,208 KB
testcase_52 AC 600 ms
69,864 KB
testcase_53 AC 622 ms
69,772 KB
testcase_54 AC 617 ms
69,768 KB
testcase_55 AC 619 ms
69,808 KB
testcase_56 AC 618 ms
69,720 KB
testcase_57 AC 278 ms
61,404 KB
testcase_58 AC 619 ms
69,848 KB
testcase_59 AC 621 ms
69,792 KB
testcase_60 AC 629 ms
69,836 KB
testcase_61 AC 599 ms
69,800 KB
testcase_62 AC 636 ms
69,852 KB
testcase_63 AC 591 ms
69,744 KB
testcase_64 AC 620 ms
69,860 KB
testcase_65 AC 616 ms
68,856 KB
testcase_66 AC 658 ms
69,004 KB
testcase_67 AC 625 ms
68,948 KB
testcase_68 AC 609 ms
68,984 KB
testcase_69 AC 598 ms
68,908 KB
testcase_70 AC 641 ms
69,028 KB
testcase_71 AC 637 ms
68,896 KB
testcase_72 AC 591 ms
68,884 KB
testcase_73 AC 599 ms
68,948 KB
testcase_74 AC 54 ms
53,864 KB
testcase_75 AC 602 ms
69,772 KB
testcase_76 AC 632 ms
69,884 KB
testcase_77 AC 618 ms
69,740 KB
testcase_78 AC 630 ms
69,832 KB
testcase_79 AC 618 ms
68,960 KB
testcase_80 AC 617 ms
68,236 KB
testcase_81 AC 598 ms
67,912 KB
testcase_82 AC 613 ms
69,888 KB
testcase_83 AC 627 ms
69,972 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 mod2 = (long)1e9+9;
    static long mod3 = 998244353;
    static long mod4 = 998244853;

    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);
        boolean[] check4 = check(A,Query,K,mod4,N);
        for(int i = 0; i < Q; i++){
            if(check1[i] || check2[i] || check3[i] || check4[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;
    }
}
0