結果
問題 | No.1172 Add Recursive Sequence |
ユーザー | uwi |
提出日時 | 2020-08-14 21:52:51 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,704 ms / 4,000 ms |
コード長 | 3,931 bytes |
コンパイル時間 | 4,587 ms |
コンパイル使用メモリ | 81,096 KB |
実行使用メモリ | 224,260 KB |
最終ジャッジ日時 | 2024-04-18 21:37:56 |
合計ジャッジ時間 | 11,451 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,700 KB |
testcase_01 | AC | 53 ms
36,752 KB |
testcase_02 | AC | 53 ms
37,236 KB |
testcase_03 | AC | 52 ms
37,044 KB |
testcase_04 | AC | 52 ms
36,696 KB |
testcase_05 | AC | 51 ms
36,960 KB |
testcase_06 | AC | 85 ms
38,140 KB |
testcase_07 | AC | 74 ms
37,264 KB |
testcase_08 | AC | 80 ms
37,788 KB |
testcase_09 | AC | 84 ms
37,900 KB |
testcase_10 | AC | 153 ms
42,928 KB |
testcase_11 | AC | 151 ms
43,260 KB |
testcase_12 | AC | 148 ms
43,156 KB |
testcase_13 | AC | 146 ms
42,460 KB |
testcase_14 | AC | 535 ms
60,320 KB |
testcase_15 | AC | 386 ms
59,924 KB |
testcase_16 | AC | 1,704 ms
224,068 KB |
testcase_17 | AC | 1,640 ms
224,260 KB |
ソースコード
package contest200814; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int K = ni(), n = ni(), m = ni(); int[] a = na(K); int[] c = na(K); long[] as = new long[n+K+5]; for(int i = 0;i < K;i++)as[i] = a[i]; int mod = 1000000007; for(int i = K;i < n+K+5;i++){ for(int j = 1;j <= K;j++){ as[i] += c[j-1] * as[i-j]; as[i] %= mod; } } long[][] vs = new long[n][K]; for(int z = 0;z < m;z++){ int l = ni(), r = ni(); for(int j = 0;j < K;j++){ vs[l][j] += as[j]; if(vs[l][j] >= mod)vs[l][j] -= mod; if(r < n){ vs[r][j] += mod - as[j+r-l]; if(vs[r][j] >= mod)vs[r][j] -= mod; } } } long[] v = new long[K]; for(int i = 0;i < n;i++){ long nv = 0; for(int j = 1;j <= K;j++){ nv += c[j-1] * v[K-j]; nv %= mod; } for(int j = 1;j <= K-1;j++){ v[j-1] = v[j]; } v[K-1] = nv; for(int j = 0;j < K;j++){ v[j] += vs[i][j]; if(v[j] >= mod)v[j] -= mod; } out.println(v[0]); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new E().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }