結果
問題 | No.314 ケンケンパ |
ユーザー | yuya178 |
提出日時 | 2017-11-11 14:47:13 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 209 ms / 1,000 ms |
コード長 | 3,943 bytes |
コンパイル時間 | 2,577 ms |
コンパイル使用メモリ | 85,384 KB |
実行使用メモリ | 81,124 KB |
最終ジャッジ日時 | 2024-11-24 19:05:00 |
合計ジャッジ時間 | 4,508 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 209 ms
80,500 KB |
testcase_01 | AC | 48 ms
36,728 KB |
testcase_02 | AC | 49 ms
36,708 KB |
testcase_03 | AC | 48 ms
36,520 KB |
testcase_04 | AC | 48 ms
36,548 KB |
testcase_05 | AC | 50 ms
36,736 KB |
testcase_06 | AC | 49 ms
36,516 KB |
testcase_07 | AC | 50 ms
36,884 KB |
testcase_08 | AC | 50 ms
36,896 KB |
testcase_09 | AC | 47 ms
36,520 KB |
testcase_10 | AC | 48 ms
36,768 KB |
testcase_11 | AC | 48 ms
36,812 KB |
testcase_12 | AC | 49 ms
36,900 KB |
testcase_13 | AC | 49 ms
36,916 KB |
testcase_14 | AC | 50 ms
36,864 KB |
testcase_15 | AC | 50 ms
37,356 KB |
testcase_16 | AC | 51 ms
37,428 KB |
testcase_17 | AC | 66 ms
44,504 KB |
testcase_18 | AC | 131 ms
65,048 KB |
testcase_19 | AC | 209 ms
81,124 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = 10000000; void solve() { int n = ni(); long[][] dp = new long[n+1][3]; dp[0][2] = 1; for(int i = 1; i <= n; i++){ dp[i][0] += dp[i-1][2]%MOD; dp[i][1] += dp[i-1][0]%MOD; dp[i][2] += dp[i-1][0]%MOD + dp[i-1][1]%MOD; } out.println((dp[n][0]+dp[n][1]+dp[n][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 Main().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) && 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)); } static class ArrayUtils { public static void fill(double[][] array, double value) { for (double[] a : array) Arrays.fill(a, value); } public static void fill(double[][][] array, double value) { for (double[][] l : array) fill(l, value); } } }