結果

問題 No.572 妖精の演奏
ユーザー uwiuwi
提出日時 2017-10-06 22:25:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 78 ms / 2,000 ms
コード長 4,046 bytes
コンパイル時間 5,127 ms
コンパイル使用メモリ 86,768 KB
実行使用メモリ 52,812 KB
最終ジャッジ日時 2023-08-10 17:13:16
合計ジャッジ時間 6,547 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,540 KB
testcase_01 AC 55 ms
50,540 KB
testcase_02 AC 55 ms
51,596 KB
testcase_03 AC 56 ms
50,500 KB
testcase_04 AC 55 ms
50,588 KB
testcase_05 AC 58 ms
50,752 KB
testcase_06 AC 60 ms
50,552 KB
testcase_07 AC 58 ms
50,624 KB
testcase_08 AC 58 ms
50,620 KB
testcase_09 AC 58 ms
50,556 KB
testcase_10 AC 76 ms
52,812 KB
testcase_11 AC 75 ms
52,436 KB
testcase_12 AC 76 ms
52,360 KB
testcase_13 AC 78 ms
52,520 KB
testcase_14 AC 64 ms
50,756 KB
testcase_15 AC 64 ms
50,564 KB
testcase_16 AC 64 ms
50,652 KB
testcase_17 AC 64 ms
50,616 KB
testcase_18 AC 57 ms
50,624 KB
testcase_19 AC 55 ms
50,700 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest171006;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl();
		int m = ni();
		long[][] a = new long[m][m];
		for(int i = 0;i < m;i++){
			for(int j = 0;j < m;j++){
				a[i][j] = nl();
			}
		}
		out.println(Arrays.stream(pow(a, new long[m], n-1)).max().getAsLong());
	}
	
	public static long[] mul(long[][] A, long[] v)
	{
		int m = A.length;
		int n = v.length;
		long[] w = new long[m];
		for(int i = 0;i < m;i++){
			long sum = Long.MIN_VALUE;
			for(int k = 0;k < n;k++){
				long x = A[i][k] + v[k];
				if(x > sum)sum = x;
			}
			w[i] = sum;
		}
		return w;
	}
	
	public static long[][] p2(long[][] A)
	{
		int n = A.length;
		long[][] C = new long[n][n];
		for(int i = 0;i < n;i++){
			Arrays.fill(C[i], Long.MIN_VALUE);
			for(int k = 0;k < n;k++){
				for(int j = 0;j < n;j++){
					long x = A[i][k] + A[k][j];
					if(x > C[i][j])C[i][j] = x;
				}
			}
		}
		return C;
	}
	
	// A^e*v
	public static long[] pow(long[][] A, long[] v, long m)
	{
		long[][] mu = A;
		long[] r = v;
		for(;m > 0;m>>>=1){
			if(m<<63<0)r = mul(mu, r);
			mu = p2(mu);
		}
		return r;
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new C().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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)); }
}
0