結果

問題 No.2592 おでぶなおばけさん 2
ユーザー shojin_proshojin_pro
提出日時 2023-12-20 00:28:45
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,698 bytes
コンパイル時間 2,759 ms
コンパイル使用メモリ 83,848 KB
実行使用メモリ 67,576 KB
最終ジャッジ日時 2024-09-27 09:15:02
合計ジャッジ時間 51,002 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,520 KB
testcase_01 AC 245 ms
56,436 KB
testcase_02 AC 369 ms
56,976 KB
testcase_03 AC 254 ms
55,832 KB
testcase_04 AC 260 ms
56,156 KB
testcase_05 AC 399 ms
58,916 KB
testcase_06 AC 378 ms
57,112 KB
testcase_07 AC 445 ms
60,008 KB
testcase_08 AC 378 ms
56,656 KB
testcase_09 AC 246 ms
56,148 KB
testcase_10 AC 311 ms
57,752 KB
testcase_11 AC 361 ms
56,740 KB
testcase_12 AC 219 ms
56,988 KB
testcase_13 AC 545 ms
64,100 KB
testcase_14 AC 526 ms
62,132 KB
testcase_15 AC 498 ms
61,924 KB
testcase_16 AC 539 ms
62,328 KB
testcase_17 AC 560 ms
62,408 KB
testcase_18 AC 492 ms
60,196 KB
testcase_19 AC 500 ms
61,808 KB
testcase_20 AC 425 ms
59,424 KB
testcase_21 AC 422 ms
59,656 KB
testcase_22 AC 437 ms
59,560 KB
testcase_23 AC 552 ms
62,528 KB
testcase_24 AC 516 ms
62,048 KB
testcase_25 AC 476 ms
61,508 KB
testcase_26 AC 463 ms
60,280 KB
testcase_27 AC 580 ms
65,632 KB
testcase_28 AC 575 ms
65,756 KB
testcase_29 AC 584 ms
66,736 KB
testcase_30 AC 603 ms
66,152 KB
testcase_31 AC 590 ms
65,860 KB
testcase_32 AC 586 ms
65,884 KB
testcase_33 AC 592 ms
65,824 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 578 ms
65,680 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 AC 588 ms
65,692 KB
testcase_59 AC 584 ms
65,616 KB
testcase_60 AC 584 ms
65,864 KB
testcase_61 AC 592 ms
65,656 KB
testcase_62 AC 591 ms
65,740 KB
testcase_63 AC 579 ms
65,676 KB
testcase_64 AC 573 ms
65,808 KB
testcase_65 AC 567 ms
64,060 KB
testcase_66 AC 571 ms
65,416 KB
testcase_67 AC 569 ms
65,396 KB
testcase_68 AC 595 ms
64,152 KB
testcase_69 AC 549 ms
65,428 KB
testcase_70 AC 573 ms
65,256 KB
testcase_71 AC 565 ms
65,480 KB
testcase_72 AC 563 ms
65,272 KB
testcase_73 AC 560 ms
65,416 KB
testcase_74 WA -
testcase_75 AC 574 ms
65,904 KB
testcase_76 AC 583 ms
65,960 KB
testcase_77 AC 593 ms
65,740 KB
testcase_78 AC 590 ms
65,548 KB
testcase_79 AC 579 ms
65,784 KB
testcase_80 AC 578 ms
65,636 KB
testcase_81 AC 579 ms
65,764 KB
testcase_82 AC 579 ms
65,468 KB
testcase_83 AC 585 ms
65,808 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 = 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);
        for(int i = 0; i < Q; i++){
            if(check1[i] & check2[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