結果
問題 | No.314 ケンケンパ |
ユーザー | uwi |
提出日時 | 2015-12-07 00:02:56 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 223 ms / 1,000 ms |
コード長 | 3,143 bytes |
コンパイル時間 | 6,591 ms |
コンパイル使用メモリ | 77,332 KB |
実行使用メモリ | 93,080 KB |
最終ジャッジ日時 | 2023-10-12 17:53:07 |
合計ジャッジ時間 | 7,096 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 223 ms
91,092 KB |
testcase_01 | AC | 43 ms
49,128 KB |
testcase_02 | AC | 42 ms
49,064 KB |
testcase_03 | AC | 43 ms
49,152 KB |
testcase_04 | AC | 42 ms
48,996 KB |
testcase_05 | AC | 43 ms
49,436 KB |
testcase_06 | AC | 42 ms
47,392 KB |
testcase_07 | AC | 42 ms
48,952 KB |
testcase_08 | AC | 42 ms
49,188 KB |
testcase_09 | AC | 43 ms
49,300 KB |
testcase_10 | AC | 45 ms
48,968 KB |
testcase_11 | AC | 43 ms
49,180 KB |
testcase_12 | AC | 43 ms
49,116 KB |
testcase_13 | AC | 42 ms
49,204 KB |
testcase_14 | AC | 45 ms
47,164 KB |
testcase_15 | AC | 44 ms
49,628 KB |
testcase_16 | AC | 48 ms
49,112 KB |
testcase_17 | AC | 66 ms
53,748 KB |
testcase_18 | AC | 142 ms
75,428 KB |
testcase_19 | AC | 223 ms
93,080 KB |
ソースコード
package contest; 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 Adv6 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int mod = 1000000007; int n = ni(); long[][] dp = new long[n][3]; dp[0][1] = 1; // p k kk for(int i = 0;i < n-1;i++){ dp[i+1][1] += dp[i][0]; dp[i+1][2] += dp[i][1]; dp[i+1][0] += dp[i][1]; dp[i+1][0] += dp[i][2]; dp[i+1][0] %= mod; dp[i+1][1] %= mod; dp[i+1][2] %= mod; } out.println((dp[n-1][0]+dp[n-1][1]+dp[n-1][2])%mod); } 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"); } public static void main(String[] args) throws Exception { new Adv6().run(); } private byte[] inbuf = new byte[1024]; private 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }