#18218 (Java21) No.147 試験監督（2）

提出ソース

結果

問題	No.147 試験監督（2）
ユーザー	uwi
提出日時	2015-04-04 16:38:42
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,400 bytes
コンパイル時間	4,647 ms
コンパイル使用メモリ	85,284 KB
実行使用メモリ	58,060 KB
最終ジャッジ日時	2024-07-04 01:57:30
合計ジャッジ時間	5,988 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	AC	52 ms 50,416 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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 Q370X {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long ret = 1;
		int[][] M = {{1, 1}, {1, 0}};
		int[][][] Ms = new int[61][][];
		Ms[0] = M;
		for(int i = 1;i <= 60;i++){
			Ms[i] = p2(Ms[i-1]);
		}
		
		for(int i = 0;i < n;i++){
			long c = nl();
			char[] ds = ns().toCharArray();
			
			long v0 = 2, v1 = 1;
			int e = 0;
			for(;c > 0;c >>>= 1){
				if((c&1) == 1){
					long nv0 = modh(Ms[e][0][0] * v0 + Ms[e][0][1] * v1);
					long nv1 = modh(Ms[e][1][0] * v0 + Ms[e][1][1] * v1);
					v0 = nv0; v1 = nv1;
				}
				e++;
			}
			
			if(ds.length <= 12){
				ret = modh(ret * pow(v1, Long.parseLong(new String(ds)), mod));
			}else{
				final long xmod = 1000000006;
				long q = 0;
				for(char d : ds){
					q = q * 10 + (d-'0');
					if(q >= 1E18)q %= xmod;
				}
				q %= xmod;
				
				ret = modh(ret * pow(v1, q, mod));
			}
		}
		out.println(ret);
	}
	
	static final long M=1152921496;
	static final int h=60;
	private static final long mask = (1L<<31)-1;
			 
	public static long modh(long a)
	{
		long r = a-((M*(a&mask)>>>31)+M*(a>>>31)>>>h-31)*mod;
		return r < mod ? r : r-mod;
	}

	
	public static int[][] pow(int[][] A, long e)
	{
		int[][] MUL = A;
		int n = A.length;
		int[][] C = new int[n][n];
		for(int i = 0;i < n;i++)C[i][i] = 1;
		for(;e > 0;e>>>=1) {
			if((e&1)==1)C = mul(C, MUL);
			MUL = p2(MUL);
		}
		return C;
	}
	
	public static int[][] mul(int[][] A, int[][] B)
	{
		int m = A.length;
		int n = A[0].length;
		int o = B[0].length;
		int[][] C = new int[m][o];
		for(int i = 0;i < m;i++){
			long[] sum = new long[n];
			for(int k = 0;k < n;k++){
				for(int j = 0;j < n;j++){
					sum[j] += (long)A[i][k] * B[k][j];
					if(sum[j] >= BIG)sum[j] -= BIG;
				}
			}
			for(int j = 0;j < n;j++){
				C[i][j] = (int)(sum[j] % mod);
			}
		}
		return C;
	}

	
	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = modh(ret*ret);
			if (n << 63 - x < 0)
				ret = modh(ret*a);
		}
		return ret;
	}
	
	///////// begin
	public static final int mod = 1000000007;
	public static final long m2 = (long) mod * mod;
	public static final long BIG = 8L * m2;

	// A^e*v
	public static int[] pow(int[][] A, int[] v, long e) {
		for (int i = 0; i < v.length; i++) {
			if (v[i] >= mod)
				v[i] %= mod;
		}
		int[][] MUL = A;
		for (; e > 0; e >>>= 1) {
			if ((e & 1) == 1)
				v = mul(MUL, v);
			MUL = p2(MUL);
		}
		return v;
	}

	// int matrix*int vector
	public static int[] mul(int[][] A, int[] v) {
		int m = A.length;
		int n = v.length;
		int[] w = new int[m];
		for (int i = 0; i < m; i++) {
			long sum = 0;
			for (int k = 0; k < n; k++) {
				sum += (long) A[i][k] * v[k];
				if (sum >= BIG)
					sum -= BIG;
			}
			w[i] = (int) (sum % mod);
		}
		return w;
	}

	// int matrix^2 (be careful about negative value)
	public static int[][] p2(int[][] A) {
		int n = A.length;
		int[][] C = new int[n][n];
		for (int i = 0; i < n; i++) {
			long[] sum = new long[n];
			for (int k = 0; k < n; k++) {
				for (int j = 0; j < n; j++) {
					sum[j] += (long) A[i][k] * A[k][j];
					if (sum[j] >= BIG)
						sum[j] -= BIG;
				}
			}
			for (int j = 0; j < n; j++) {
				C[i][j] = (int) (sum[j] % mod);
			}
		}
		return C;
	}

	//////////// end

	
	void run() throws Exception
	{
//		int n = 30000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(Math.abs(gen.nextLong() % 1000000000000000000L) + " ");
//			for(int j = 0;j < 200;j++){
//				sb.append(gen.nextInt(10));
//			}
//			sb.append("\n");
//		}
//		INPUT = sb.toString();
		
		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 Q370X().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)); }
}

yukicoder

結果

テストケース

ソースコード