結果
問題 | No.1811 EQUIV Ten |
ユーザー | nishi5451 |
提出日時 | 2022-01-27 23:00:25 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 107 ms / 2,000 ms |
コード長 | 3,221 bytes |
コンパイル時間 | 3,706 ms |
コンパイル使用メモリ | 75,068 KB |
実行使用メモリ | 65,860 KB |
最終ジャッジ日時 | 2023-08-27 01:29:13 |
合計ジャッジ時間 | 6,083 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,264 KB |
testcase_01 | AC | 42 ms
47,296 KB |
testcase_02 | AC | 40 ms
49,456 KB |
testcase_03 | AC | 41 ms
49,212 KB |
testcase_04 | AC | 41 ms
49,220 KB |
testcase_05 | AC | 42 ms
49,512 KB |
testcase_06 | AC | 42 ms
49,628 KB |
testcase_07 | AC | 42 ms
49,788 KB |
testcase_08 | AC | 40 ms
49,280 KB |
testcase_09 | AC | 41 ms
49,300 KB |
testcase_10 | AC | 42 ms
49,380 KB |
testcase_11 | AC | 98 ms
64,972 KB |
testcase_12 | AC | 97 ms
64,964 KB |
testcase_13 | AC | 103 ms
65,460 KB |
testcase_14 | AC | 97 ms
65,860 KB |
testcase_15 | AC | 95 ms
65,716 KB |
testcase_16 | AC | 42 ms
49,172 KB |
testcase_17 | AC | 41 ms
49,208 KB |
testcase_18 | AC | 42 ms
49,356 KB |
testcase_19 | AC | 42 ms
49,220 KB |
testcase_20 | AC | 46 ms
49,164 KB |
testcase_21 | AC | 46 ms
49,516 KB |
testcase_22 | AC | 42 ms
49,376 KB |
testcase_23 | AC | 76 ms
56,192 KB |
testcase_24 | AC | 51 ms
49,968 KB |
testcase_25 | AC | 44 ms
49,496 KB |
testcase_26 | AC | 74 ms
56,384 KB |
testcase_27 | AC | 42 ms
49,532 KB |
testcase_28 | AC | 41 ms
49,172 KB |
testcase_29 | AC | 42 ms
49,116 KB |
testcase_30 | AC | 96 ms
64,972 KB |
testcase_31 | AC | 45 ms
49,324 KB |
testcase_32 | AC | 50 ms
50,236 KB |
testcase_33 | AC | 50 ms
50,416 KB |
testcase_34 | AC | 107 ms
64,820 KB |
testcase_35 | AC | 73 ms
56,672 KB |
ソースコード
import java.util.*; import java.util.stream.*; import java.io.*; public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; static long modPow(long p, long n){ p %= MOD; long ret = 1; while(n > 0){ if((n & 1) == 1) ret = ret * p % MOD; p = p * p % MOD; n >>= 1; } return ret; } public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); int n = fs.nextInt(); if(n <= 3){ pw.println(0); } else { long[][] dp = new long[n+1][8]; for(int i = 0; i < 8; i++) dp[3][i] = 1; for(int i = 3; i < n; i++){ dp[i+1][0] = dp[i][0] + dp[i][1]; dp[i+1][1] = dp[i][2] + dp[i][3]; dp[i+1][2] = dp[i][4] + dp[i][5]; dp[i+1][3] = dp[i][6] + dp[i][7]; dp[i+1][4] = dp[i][0] + dp[i][1]; dp[i+1][5] = dp[i][3]; dp[i+1][6] = dp[i][4] + dp[i][5]; dp[i+1][7] = dp[i][6] + dp[i][7]; for(int j = 0; j < 8; j++) dp[i+1][j] %= MOD; } long ans = 0; for(int i = 0; i < 8; i++) ans = (ans + dp[n][i]) % MOD; ans = (modPow(2, n) - ans + MOD) % MOD; pw.println(ans); } pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }