結果
問題 | No.801 エレベーター |
ユーザー | kusomushi |
提出日時 | 2019-07-30 03:54:30 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,539 ms / 2,000 ms |
コード長 | 7,069 bytes |
コンパイル時間 | 2,586 ms |
コンパイル使用メモリ | 85,888 KB |
実行使用メモリ | 49,944 KB |
最終ジャッジ日時 | 2024-07-02 15:38:34 |
合計ジャッジ時間 | 29,122 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
37,364 KB |
testcase_01 | AC | 52 ms
37,192 KB |
testcase_02 | AC | 49 ms
37,324 KB |
testcase_03 | AC | 180 ms
44,820 KB |
testcase_04 | AC | 180 ms
44,932 KB |
testcase_05 | AC | 179 ms
44,408 KB |
testcase_06 | AC | 180 ms
44,776 KB |
testcase_07 | AC | 176 ms
43,644 KB |
testcase_08 | AC | 183 ms
44,848 KB |
testcase_09 | AC | 202 ms
44,764 KB |
testcase_10 | AC | 195 ms
44,872 KB |
testcase_11 | AC | 177 ms
44,320 KB |
testcase_12 | AC | 201 ms
43,952 KB |
testcase_13 | AC | 1,393 ms
49,304 KB |
testcase_14 | AC | 1,304 ms
49,440 KB |
testcase_15 | AC | 1,472 ms
49,640 KB |
testcase_16 | AC | 1,420 ms
49,304 KB |
testcase_17 | AC | 1,436 ms
49,348 KB |
testcase_18 | AC | 1,539 ms
49,136 KB |
testcase_19 | AC | 1,409 ms
49,604 KB |
testcase_20 | AC | 1,359 ms
49,504 KB |
testcase_21 | AC | 1,327 ms
49,236 KB |
testcase_22 | AC | 1,343 ms
49,308 KB |
testcase_23 | AC | 1,314 ms
49,372 KB |
testcase_24 | AC | 1,244 ms
49,880 KB |
testcase_25 | AC | 1,390 ms
49,944 KB |
testcase_26 | AC | 1,406 ms
49,260 KB |
testcase_27 | AC | 1,355 ms
49,260 KB |
testcase_28 | AC | 1,354 ms
48,224 KB |
ソースコード
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; debug(curr); } 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()); } }