結果

問題 No.90 品物の並び替え
ユーザー yuya178yuya178
提出日時 2017-11-13 00:12:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 236 ms / 5,000 ms
コード長 5,453 bytes
コンパイル時間 5,918 ms
コンパイル使用メモリ 93,536 KB
実行使用メモリ 53,556 KB
最終ジャッジ日時 2024-11-24 23:24:20
合計ジャッジ時間 4,986 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
50,180 KB
testcase_01 AC 123 ms
53,556 KB
testcase_02 AC 52 ms
50,184 KB
testcase_03 AC 77 ms
51,156 KB
testcase_04 AC 70 ms
50,984 KB
testcase_05 AC 120 ms
53,064 KB
testcase_06 AC 122 ms
52,864 KB
testcase_07 AC 51 ms
50,196 KB
testcase_08 AC 52 ms
50,284 KB
testcase_09 AC 236 ms
53,324 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    
    void solve()
    {
        int n = ni();
        int m = ni();
        int[][] g = new int[n][n];
        for(int i = 0; i < m; i++){
            g[ni()][ni()] = ni();
        }

        Permutation p = new Permutation(n,n);
        int max = 0;
        while(p.next()) {
            int res = 0;
            for(int i = 0; i < n; i++){
                for(int j = i; j < n; j++){
                    if(g[p.p[i]][p.p[j]]>0) res+=g[p.p[i]][p.p[j]];
                }
            }
            max = Math.max(max, res);
        }
        out.println(max);
    }

    class Permutation{
        // max=10
        // n=10: 160ms
        // n=11: 1600-1700ms
        int n;
        int max;
        BitSet used;
        int[] p;
        public Permutation(int n, int max){
            this.n = n;
            this.max = max;
            used = new BitSet(n);
            p = new int[n];
        }
        
        public boolean next(){
            if(used.cardinality() == 0){
                for(int i=0; i<n; i++){
                    p[i] = i;
                }
                used.set(0, n);
                return true;
            }
            int i;
            for(i=n-1; i>=0; i--){
                used.clear(p[i]);
                if((used.nextClearBit(p[i]+1)) < max) break;
            }
            if(i<0) return false;
            p[i] = used.nextClearBit(p[i]+1);
            used.set(p[i]);
            int idx = i+1;
            for(i=used.nextClearBit(0); i<max && idx<n; i=used.nextClearBit(i+1)){
                p[idx++] = i;
                used.set(i);
            }
            return true;
        }
        
        public String toString(){
            StringBuilder sb = new StringBuilder();
            for(int i=0; i<n; i++){
                sb.append(p[i]+" ");
            }
            return sb.toString();
        }
    }

    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().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) && 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0