結果

問題 No.2592 おでぶなおばけさん 2
ユーザー shojin_proshojin_pro
提出日時 2023-12-20 00:28:45
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,698 bytes
コンパイル時間 3,686 ms
コンパイル使用メモリ 79,516 KB
実行使用メモリ 70,256 KB
最終ジャッジ日時 2023-12-20 01:14:12
合計ジャッジ時間 54,204 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
53,984 KB
testcase_01 AC 274 ms
60,252 KB
testcase_02 AC 377 ms
62,120 KB
testcase_03 AC 255 ms
59,472 KB
testcase_04 AC 279 ms
59,672 KB
testcase_05 AC 406 ms
62,536 KB
testcase_06 AC 410 ms
60,720 KB
testcase_07 AC 443 ms
63,704 KB
testcase_08 AC 371 ms
60,204 KB
testcase_09 AC 261 ms
59,756 KB
testcase_10 AC 320 ms
61,540 KB
testcase_11 AC 378 ms
60,192 KB
testcase_12 AC 223 ms
59,632 KB
testcase_13 AC 536 ms
66,048 KB
testcase_14 AC 536 ms
66,004 KB
testcase_15 AC 505 ms
63,820 KB
testcase_16 AC 559 ms
67,364 KB
testcase_17 AC 560 ms
66,980 KB
testcase_18 AC 504 ms
63,760 KB
testcase_19 AC 492 ms
63,988 KB
testcase_20 AC 464 ms
63,192 KB
testcase_21 AC 403 ms
62,964 KB
testcase_22 AC 462 ms
63,172 KB
testcase_23 AC 579 ms
66,880 KB
testcase_24 AC 510 ms
67,300 KB
testcase_25 AC 478 ms
63,632 KB
testcase_26 AC 473 ms
63,416 KB
testcase_27 AC 592 ms
69,312 KB
testcase_28 AC 618 ms
69,300 KB
testcase_29 AC 604 ms
70,256 KB
testcase_30 AC 608 ms
70,016 KB
testcase_31 AC 594 ms
69,712 KB
testcase_32 AC 585 ms
69,508 KB
testcase_33 AC 603 ms
69,424 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 592 ms
69,476 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 601 ms
69,328 KB
testcase_59 AC 597 ms
69,468 KB
testcase_60 AC 598 ms
69,816 KB
testcase_61 AC 607 ms
69,696 KB
testcase_62 AC 599 ms
69,476 KB
testcase_63 AC 585 ms
69,344 KB
testcase_64 AC 626 ms
69,484 KB
testcase_65 AC 579 ms
69,012 KB
testcase_66 AC 593 ms
68,980 KB
testcase_67 AC 591 ms
69,124 KB
testcase_68 AC 563 ms
69,024 KB
testcase_69 AC 596 ms
69,028 KB
testcase_70 AC 609 ms
69,412 KB
testcase_71 AC 588 ms
69,108 KB
testcase_72 AC 636 ms
69,108 KB
testcase_73 AC 596 ms
69,092 KB
testcase_74 AC 627 ms
69,364 KB
testcase_75 AC 577 ms
69,408 KB
testcase_76 AC 587 ms
67,436 KB
testcase_77 AC 601 ms
69,472 KB
testcase_78 AC 579 ms
69,328 KB
testcase_79 AC 583 ms
69,644 KB
testcase_80 AC 587 ms
69,480 KB
testcase_81 AC 593 ms
69,384 KB
testcase_82 AC 579 ms
69,332 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