結果

問題 No.1811 EQUIV Ten
コンテスト
ユーザー nishi5451
提出日時 2022-01-27 23:00:25
言語 Java
(openjdk 23)
結果
AC  
実行時間 142 ms / 2,000 ms
コード長 3,221 bytes
コンパイル時間 2,584 ms
コンパイル使用メモリ 78,280 KB
実行使用メモリ 55,468 KB
最終ジャッジ日時 2024-12-26 05:58:21
合計ジャッジ時間 6,461 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
	}
}
0