結果

問題 No.572 妖精の演奏
コンテスト
ユーザー yuya178
提出日時 2017-10-08 00:32:13
言語 Java
(openjdk 23)
結果
AC  
実行時間 97 ms / 2,000 ms
コード長 5,360 bytes
コンパイル時間 2,524 ms
コンパイル使用メモリ 83,024 KB
実行使用メモリ 39,172 KB
最終ジャッジ日時 2024-11-17 04:41:44
合計ジャッジ時間 4,745 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

public class Main {
    static InputStream is;
    static PrintWriter out;
    static String INPUT = "";
    
    static void solve()
    {
        int n = ni();
        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] = ni();
            }
        }
        long[] v = new long[m];
        n--;
        while(n>0){
            if((n & 1) == 1){
                v = mul(A,v);
            }
            A = p2(A);
            n >>= 1;
        }
        Arrays.sort(v);
        out.println(v[m-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.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;
}

    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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
            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)); }

    private static int[] nsi(){
        char[] s = ns().toCharArray();
        int[] a = new int[s.length];
        for(int j = 0; j < s.length; j++){
           a[j] = s[j] - '0';
        }
        return a;
    }
}
0