結果

問題 No.1810 RGB Biscuits
ユーザー nishi5451nishi5451
提出日時 2022-01-27 22:18:03
言語 Java21
(openjdk 21)
結果
AC  
実行時間 163 ms / 2,000 ms
コード長 3,590 bytes
コンパイル時間 2,517 ms
コンパイル使用メモリ 75,168 KB
実行使用メモリ 55,380 KB
最終ジャッジ日時 2023-08-27 00:34:59
合計ジャッジ時間 5,854 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,436 KB
testcase_01 AC 43 ms
49,516 KB
testcase_02 AC 41 ms
49,408 KB
testcase_03 AC 46 ms
49,344 KB
testcase_04 AC 46 ms
49,584 KB
testcase_05 AC 159 ms
55,060 KB
testcase_06 AC 163 ms
55,380 KB
testcase_07 AC 151 ms
54,976 KB
testcase_08 AC 143 ms
55,072 KB
testcase_09 AC 154 ms
55,084 KB
testcase_10 AC 132 ms
55,076 KB
testcase_11 AC 56 ms
49,556 KB
testcase_12 AC 45 ms
49,740 KB
testcase_13 AC 45 ms
47,232 KB
testcase_14 AC 78 ms
54,664 KB
testcase_15 AC 45 ms
47,600 KB
testcase_16 AC 61 ms
50,812 KB
testcase_17 AC 117 ms
55,184 KB
testcase_18 AC 123 ms
55,064 KB
testcase_19 AC 42 ms
49,388 KB
testcase_20 AC 43 ms
49,508 KB
testcase_21 AC 79 ms
52,064 KB
権限があれば一括ダウンロードができます

ソースコード

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[][] matMul(long[][] A, long[][] B){
		int p = A.length;
		int r = A[0].length;
		int q = B[0].length;
		long[][] ret = new long[p][q];
		for(int i = 0; i < p; i++){
			for(int j = 0; j < q; j++){
				for(int k = 0; k < r; k++){
					ret[i][j] += A[i][k] * B[k][j];
					ret[i][j] %= MOD;
				}
			}
		}
		return ret;
	}
	static long[][] matPow(long[][] A, long n){
		int m = A.length;
		long[][] ret = new long[m][m];
		for(int i = 0; i < m; i++) ret[i][i] = 1;

		long[][] mat = new long[m][m];
		for(int i = 0; i < m; i++){
			for(int j = 0; j < m; j++){
				mat[i][j] = A[i][j];
			}
		}
		while(n > 0){
			if((n & 1) == 1) ret = matMul(mat, ret);
			mat = matMul(mat, mat);
			n >>= 1;
		}
		return ret;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		long a = fs.nextLong();
		long b = fs.nextLong();
		int n = fs.nextInt();
		long[][] op1 = {
			{1, 0, 0}, 
			{0, 1, 0},
			{a, b, 0}
		};
		long[][] op2 = {
 			{0, 0, 1}, 
			{1, 0, 0},
			{0, 0, 0}
		};
		long[][] opm = matMul(op2, op1);
		for(int i = 0; i < n; i++){
			long t = fs.nextLong();
			long[][] dp = {{1},{1},{0}};
			dp = matMul(matPow(opm, t/2), dp);
			if(t%2 == 1) dp = matMul(op1, dp);
			long ans = (dp[0][0] + dp[1][0] + dp[2][0]) % 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