結果

問題 No.31 悪のミックスジュース
ユーザー uwiuwi
提出日時 2014-10-28 20:26:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 150 ms / 5,000 ms
コード長 4,717 bytes
コンパイル時間 3,437 ms
コンパイル使用メモリ 81,432 KB
実行使用メモリ 54,892 KB
最終ジャッジ日時 2023-10-12 17:13:58
合計ジャッジ時間 6,382 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
50,672 KB
testcase_01 AC 148 ms
54,892 KB
testcase_02 AC 141 ms
54,596 KB
testcase_03 AC 150 ms
54,348 KB
testcase_04 AC 146 ms
54,352 KB
testcase_05 AC 145 ms
54,456 KB
testcase_06 AC 68 ms
50,824 KB
testcase_07 AC 149 ms
54,348 KB
testcase_08 AC 147 ms
54,356 KB
testcase_09 AC 150 ms
54,516 KB
testcase_10 AC 67 ms
50,512 KB
testcase_11 AC 89 ms
52,640 KB
testcase_12 AC 122 ms
52,448 KB
testcase_13 AC 67 ms
50,720 KB
testcase_14 AC 146 ms
54,764 KB
testcase_15 AC 77 ms
50,464 KB
testcase_16 AC 96 ms
51,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), V = ni();
		long[] c = new long[n];
		for(int i = 0;i < n;i++){
			c[i] = nl();
		}
		for(int i = 1;i < n;i++){
			c[i] += c[i-1];
		}
		V -= n;
		long[][] A = new long[n][n];
		for(int i = 0;i < n;i++){
			A[0][i] = c[i];
		}
		for(int i = 1;i < n;i++){
			Arrays.fill(A[i], Long.MAX_VALUE / 2);
			A[i][i-1] = 0;
		}
	
		long[] v = new long[n];
		Arrays.fill(v, Long.MAX_VALUE / 2);
		v[0] = 0;
		out.println(pow(A, v, V)[0] + c[n-1]);
	}
	
	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.MAX_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.MAX_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;
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0