結果
問題 | No.801 エレベーター |
ユーザー | hiromi_ayase |
提出日時 | 2019-03-23 16:16:49 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 773 ms / 2,000 ms |
コード長 | 3,217 bytes |
コンパイル時間 | 4,049 ms |
コンパイル使用メモリ | 82,740 KB |
実行使用メモリ | 232,892 KB |
最終ジャッジ日時 | 2023-10-23 22:01:17 |
合計ジャッジ時間 | 19,142 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
54,384 KB |
testcase_01 | AC | 78 ms
54,396 KB |
testcase_02 | AC | 79 ms
52,352 KB |
testcase_03 | AC | 126 ms
58,504 KB |
testcase_04 | AC | 125 ms
58,708 KB |
testcase_05 | AC | 123 ms
58,412 KB |
testcase_06 | AC | 122 ms
58,452 KB |
testcase_07 | AC | 122 ms
58,460 KB |
testcase_08 | AC | 123 ms
58,508 KB |
testcase_09 | AC | 124 ms
58,472 KB |
testcase_10 | AC | 122 ms
58,508 KB |
testcase_11 | AC | 124 ms
58,764 KB |
testcase_12 | AC | 128 ms
58,872 KB |
testcase_13 | AC | 767 ms
232,644 KB |
testcase_14 | AC | 765 ms
232,736 KB |
testcase_15 | AC | 763 ms
232,608 KB |
testcase_16 | AC | 766 ms
232,824 KB |
testcase_17 | AC | 760 ms
232,324 KB |
testcase_18 | AC | 768 ms
232,796 KB |
testcase_19 | AC | 759 ms
232,272 KB |
testcase_20 | AC | 764 ms
232,892 KB |
testcase_21 | AC | 765 ms
232,756 KB |
testcase_22 | AC | 773 ms
232,656 KB |
testcase_23 | AC | 739 ms
231,888 KB |
testcase_24 | AC | 735 ms
232,708 KB |
testcase_25 | AC | 732 ms
232,116 KB |
testcase_26 | AC | 734 ms
232,820 KB |
testcase_27 | AC | 733 ms
232,652 KB |
testcase_28 | AC | 738 ms
232,672 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int m = ni(); int k = ni(); int[][] r = ntable(m, 2); long[][] dp = new long[k + 1][n + 1]; long[][] sum = new long[k + 1][n + 1]; int mod = (int) 1e9 + 7; dp[0][0] = 1; for (int i = 0; i < n; i ++) { sum[0][i + 1] = sum[0][i] + dp[0][i]; } for (int i = 0; i < k; i++) { for (int[] p : r) { long s = (sum[i][p[1]] - sum[i][p[0]-1]) % mod; dp[i + 1][p[0]-1] += s; dp[i + 1][p[1]] += mod - s; } long now = 0; for (int j = 0; j < n; j ++) { now = (dp[i + 1][j] + now) % mod; dp[i + 1][j] = now; } for (int j = 0; j < n; j ++) { sum[i + 1][j + 1] = sum[i + 1][j] + dp[i + 1][j]; sum[i + 1][j + 1] %= mod; } } System.out.println(dp[k][n-1]); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }