結果

問題 No.2592 おでぶなおばけさん 2
ユーザー shojin_proshojin_pro
提出日時 2023-12-20 00:19:47
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,086 bytes
コンパイル時間 3,876 ms
コンパイル使用メモリ 78,644 KB
実行使用メモリ 68,836 KB
最終ジャッジ日時 2023-12-20 01:13:23
合計ジャッジ時間 47,221 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
54,000 KB
testcase_01 AC 220 ms
60,124 KB
testcase_02 AC 320 ms
60,368 KB
testcase_03 AC 238 ms
59,644 KB
testcase_04 AC 221 ms
59,140 KB
testcase_05 AC 336 ms
61,624 KB
testcase_06 AC 343 ms
60,284 KB
testcase_07 AC 357 ms
60,152 KB
testcase_08 AC 320 ms
60,700 KB
testcase_09 AC 233 ms
60,192 KB
testcase_10 AC 253 ms
57,956 KB
testcase_11 AC 346 ms
60,208 KB
testcase_12 AC 201 ms
58,660 KB
testcase_13 AC 470 ms
63,160 KB
testcase_14 AC 468 ms
64,644 KB
testcase_15 AC 429 ms
62,200 KB
testcase_16 AC 459 ms
64,456 KB
testcase_17 AC 475 ms
63,272 KB
testcase_18 AC 431 ms
61,208 KB
testcase_19 AC 416 ms
62,436 KB
testcase_20 AC 372 ms
62,560 KB
testcase_21 AC 389 ms
62,388 KB
testcase_22 AC 382 ms
60,028 KB
testcase_23 AC 488 ms
62,444 KB
testcase_24 AC 445 ms
63,108 KB
testcase_25 AC 388 ms
59,296 KB
testcase_26 AC 393 ms
61,204 KB
testcase_27 AC 536 ms
68,696 KB
testcase_28 AC 476 ms
68,676 KB
testcase_29 AC 509 ms
68,836 KB
testcase_30 AC 498 ms
68,772 KB
testcase_31 AC 520 ms
68,664 KB
testcase_32 AC 520 ms
68,664 KB
testcase_33 AC 517 ms
68,728 KB
testcase_34 WA -
testcase_35 AC 507 ms
66,676 KB
testcase_36 AC 519 ms
66,644 KB
testcase_37 AC 486 ms
65,352 KB
testcase_38 AC 548 ms
66,652 KB
testcase_39 AC 515 ms
66,656 KB
testcase_40 AC 510 ms
66,612 KB
testcase_41 AC 511 ms
66,612 KB
testcase_42 AC 511 ms
66,600 KB
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 530 ms
68,676 KB
testcase_59 AC 559 ms
68,700 KB
testcase_60 AC 542 ms
68,692 KB
testcase_61 AC 496 ms
68,652 KB
testcase_62 AC 521 ms
68,652 KB
testcase_63 AC 528 ms
66,652 KB
testcase_64 AC 539 ms
68,688 KB
testcase_65 AC 540 ms
64,564 KB
testcase_66 AC 518 ms
64,596 KB
testcase_67 AC 538 ms
64,592 KB
testcase_68 AC 485 ms
63,412 KB
testcase_69 AC 516 ms
64,580 KB
testcase_70 AC 511 ms
64,544 KB
testcase_71 AC 533 ms
64,588 KB
testcase_72 AC 513 ms
64,520 KB
testcase_73 AC 485 ms
63,276 KB
testcase_74 AC 498 ms
66,656 KB
testcase_75 AC 517 ms
66,612 KB
testcase_76 AC 517 ms
66,628 KB
testcase_77 AC 536 ms
66,624 KB
testcase_78 AC 509 ms
66,588 KB
testcase_79 AC 498 ms
66,636 KB
testcase_80 AC 523 ms
66,636 KB
testcase_81 AC 508 ms
66,696 KB
testcase_82 AC 520 ms
66,636 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();
        if(K == mod){
            mod = mod2;
        }
        K %= mod;
        long[] sum = new long[N+1];
        long now = 1;
        for(int i = 0; i < N; i++){
            long v = sc.nextLong();
            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 = sc.nextInt()-1;
            int r = sc.nextInt();
            if(sum[r] - sum[l] != 0){
                pw.println("Yes");
            }else{
                pw.println("No");
            }
        }
    }

    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