結果

問題 No.801 エレベーター
ユーザー kusomushikusomushi
提出日時 2019-07-30 03:55:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 493 ms / 2,000 ms
コード長 7,044 bytes
コンパイル時間 3,600 ms
コンパイル使用メモリ 81,396 KB
実行使用メモリ 46,700 KB
最終ジャッジ日時 2024-07-02 15:36:33
合計ジャッジ時間 11,478 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,792 KB
testcase_01 AC 47 ms
37,348 KB
testcase_02 AC 47 ms
37,480 KB
testcase_03 AC 80 ms
39,664 KB
testcase_04 AC 89 ms
39,568 KB
testcase_05 AC 82 ms
39,512 KB
testcase_06 AC 85 ms
39,416 KB
testcase_07 AC 84 ms
39,736 KB
testcase_08 AC 82 ms
39,220 KB
testcase_09 AC 79 ms
39,768 KB
testcase_10 AC 80 ms
39,432 KB
testcase_11 AC 82 ms
39,776 KB
testcase_12 AC 84 ms
39,596 KB
testcase_13 AC 478 ms
46,640 KB
testcase_14 AC 472 ms
46,080 KB
testcase_15 AC 436 ms
46,548 KB
testcase_16 AC 444 ms
46,196 KB
testcase_17 AC 446 ms
46,700 KB
testcase_18 AC 437 ms
46,416 KB
testcase_19 AC 457 ms
46,428 KB
testcase_20 AC 493 ms
45,848 KB
testcase_21 AC 469 ms
46,576 KB
testcase_22 AC 475 ms
46,392 KB
testcase_23 AC 483 ms
45,516 KB
testcase_24 AC 448 ms
46,356 KB
testcase_25 AC 449 ms
45,972 KB
testcase_26 AC 434 ms
45,884 KB
testcase_27 AC 438 ms
45,500 KB
testcase_28 AC 460 ms
46,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.Arrays;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.function.Function;

public class Main {

    static int N, M, K;
    static int[] L, R;

    public static void main(String[] args) {
        FastScanner sc = new FastScanner(System.in);
        N = sc.nextInt();
        M = sc.nextInt();
        K = sc.nextInt();
        L = new int[M];
        R = new int[M];
        for (int i = 0; i < M; i++) {
            // [L, R), 0-origin
            L[i] = sc.nextInt()-1;
            R[i] = sc.nextInt();
        }

        System.out.println(solve());
    }

    static int solve() {
        int[] curr = new int[N];
        int[] next = new int[N];
        curr[0] = 1;

        for (int i = 0; i < K; i++) {
            Arrays.fill(next, 0);
            int[] cum = new int[N+1];
            for (int j = 0; j < N; j++) {
                cum[j+1] = add(cum[j], curr[j]);
            }
            int[] imos = new int[N+1];
            for (int j = 0; j < M; j++) {
                // [L, R)
                int cnt = sub(cum[R[j]], cum[L[j]]);
                imos[L[j]] += cnt;
                imos[L[j]] %= MOD;

                imos[R[j]] -= cnt;
                imos[R[j]] += MOD;
                imos[R[j]] %= MOD;
            }

            for (int j = 0; j < N; j++) {
                imos[j+1] += imos[j];
                imos[j+1] %= MOD;
            }
            for (int j = 0; j < N; j++) {
                next[j] = imos[j];
            }

            int[] t = curr;
            curr = next;
            next = t;
        }

        return curr[N-1];
    }

    static int MOD = 1_000_000_007;

    static int pow(int base, long exp) {
        if (exp == 0) return 1;

        int ans = 1;
        base %= MOD;
        while (exp > 0) {
            if ((exp & 1) == 1) {
                ans = mul(ans, base);
            }

            base = mul(base, base);
            exp = exp >> 1;
        }
        return ans;
    }

    static int sub(int a, int b) {
        int c = a - b;
        if (c < 0) c += MOD;
        return c;
    }

    static int div(int a, int b) {
        return mul(a, pow(b, MOD - 2));
    }

    static int add(int a, int b) {
        int c = a + b;
        if (c >= MOD) c %= MOD;
        return c;
    }

    static int mul(int a, int b) {
        long c = (long) a * b;
        if (c >= MOD) c %= MOD;
        return (int) c;
    }

    static class FermatCombination {
        private final int size;
        private final int[] factorial; // n -> factorial(n)
        private final int[] inverse;   // n -> inverse(factorial(n))

        FermatCombination(int size) {
            this.size = size;
            factorial = new int[size + 1];
            inverse = new int[size + 1];

            init();
        }

        private void init() {
            factorial[0] = 1;
            factorial[1] = 1;
            inverse[0] = 1;
            inverse[1] = 1;
            for (int i = 2; i <= size; i++) {
                factorial[i] = mul(factorial[i - 1], i);
                inverse[i] = pow(factorial[i], MOD - 2);
            }
        }

        int comb(int n, int k) {
            if (n > size) throw new RuntimeException("wtf : size=" + size + " n=" + n);
            return mul(mul(factorial[n], inverse[k]), inverse[n - k]);
        }

        // 重複組み合わせ
        // k種類からn個選ぶ場合の数
        int hcomb(int k, int n) {
            return comb(k + n - 1, n);
        }

        int group(int n, int g, int k) {
            // C(n, g) * C(n-g, g)... / k!
            // n! / (n-gk)! / g! ^ k / k!
            int ret = factorial[n];             // n!
            ret = mul(ret, inverse[n - g * k]);   // 1 / (n-gk)!
            ret = mul(ret, pow(inverse[g], k)); // 1 / (g! ^ k)
            ret = mul(ret, inverse[k]);         // 1 / k!
            return ret;
        }
    }

    @SuppressWarnings("unused")
    static class FastScanner {
        private BufferedReader reader;
        private StringTokenizer tokenizer;

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

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

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

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

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

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

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

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

    static <A> void writeLines(A[] as, Function<A, String> f) {
        PrintWriter pw = new PrintWriter(System.out);
        for (A a : as) {
            pw.println(f.apply(a));
        }
        pw.flush();
    }

    static void writeLines(int[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (int a : as) pw.println(a);
        pw.flush();
    }

    static void writeLines(long[] as) {
        PrintWriter pw = new PrintWriter(System.out);
        for (long a : as) pw.println(a);
        pw.flush();
    }

    static int max(int... as) {
        int max = Integer.MIN_VALUE;
        for (int a : as) max = Math.max(a, max);
        return max;
    }

    static int min(int... as) {
        int min = Integer.MAX_VALUE;
        for (int a : as) min = Math.min(a, min);
        return min;
    }

    static void debug(Object... args) {
        StringJoiner j = new StringJoiner(" ");
        for (Object arg : args) {
            if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
            else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
            else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
            else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
            else j.add(arg.toString());
        }
        System.err.println(j.toString());
    }
}
0