結果

問題 No.90 品物の並び替え
ユーザー amyuamyu
提出日時 2016-06-16 18:54:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 159 ms / 5,000 ms
コード長 4,701 bytes
コンパイル時間 3,107 ms
コンパイル使用メモリ 79,188 KB
実行使用メモリ 52,296 KB
最終ジャッジ日時 2024-10-09 16:34:46
合計ジャッジ時間 4,461 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,548 KB
testcase_01 AC 94 ms
52,296 KB
testcase_02 AC 55 ms
50,404 KB
testcase_03 AC 62 ms
50,308 KB
testcase_04 AC 61 ms
50,320 KB
testcase_05 AC 117 ms
52,148 KB
testcase_06 AC 108 ms
52,280 KB
testcase_07 AC 58 ms
50,472 KB
testcase_08 AC 57 ms
50,552 KB
testcase_09 AC 159 ms
52,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main{
    static final Reader sc = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);

    public static void main(String[] args) throws Exception {
    	
    	int n = sc.nextInt();
    	int m = sc.nextInt();
    	int[][] score = new int[n][n];
    	for(int i=0;i<m;i++){
    		score[sc.nextInt()][sc.nextInt()] = sc.nextInt();
    	}
        int max = 0;
        int[] a = new int[n];
        for(int i=0;i<n;i++){
            a[i] = i;
        }
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                max += score[i][j];
            }
        }
        while(nextPermutation(a)){
            int count = 0;
            for(int i=0;i<n;i++){
                for(int j=i+1;j<n;j++){
                    count += score[a[i]][a[j]];
                }
            }
            max = Math.max(max,count);
        }
        out.println(max);
        out.flush();
        sc.close();
        out.close();
    }

  public static boolean nextPermutation(int[] a) {
    for (int i = a.length - 1; i > 0; --i) {
      if (a[i - 1] < a[i]) {
        int swapIndex = find(a[i - 1], a, i, a.length - 1);
        int temp = a[swapIndex];
        a[swapIndex] = a[i - 1];
        a[i - 1] = temp;
        Arrays.sort(a, i, a.length);
        return true;
      }
    }
    return false;
  }

  private static int find(int dest, int[] a, int s, int e) {
    if (s == e) {
      return s;
    }
    int m = (s + e + 1) / 2;
    return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
  }
    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}

class Reader {

    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}

    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }

    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    public boolean hasNext() {skip(); return hasNextByte();}

    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }

        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }

    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }

    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0