結果

問題 No.848 なかよし旅行
ユーザー threepipes_sthreepipes_s
提出日時 2019-07-05 23:42:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 870 ms / 2,000 ms
コード長 4,831 bytes
コンパイル時間 2,748 ms
コンパイル使用メモリ 79,024 KB
実行使用メモリ 68,300 KB
最終ジャッジ日時 2023-08-07 19:46:36
合計ジャッジ時間 13,705 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 870 ms
67,724 KB
testcase_01 AC 57 ms
34,504 KB
testcase_02 AC 44 ms
33,968 KB
testcase_03 AC 51 ms
34,108 KB
testcase_04 AC 52 ms
34,340 KB
testcase_05 AC 49 ms
34,524 KB
testcase_06 AC 70 ms
35,608 KB
testcase_07 AC 55 ms
34,960 KB
testcase_08 AC 87 ms
36,320 KB
testcase_09 AC 112 ms
37,144 KB
testcase_10 AC 89 ms
36,136 KB
testcase_11 AC 399 ms
45,412 KB
testcase_12 AC 458 ms
49,940 KB
testcase_13 AC 630 ms
54,204 KB
testcase_14 AC 252 ms
42,428 KB
testcase_15 AC 547 ms
48,660 KB
testcase_16 AC 771 ms
68,300 KB
testcase_17 AC 618 ms
54,432 KB
testcase_18 AC 371 ms
45,776 KB
testcase_19 AC 352 ms
44,716 KB
testcase_20 AC 170 ms
39,112 KB
testcase_21 AC 662 ms
56,472 KB
testcase_22 AC 699 ms
66,604 KB
testcase_23 AC 168 ms
38,880 KB
testcase_24 AC 44 ms
34,020 KB
testcase_25 AC 746 ms
60,520 KB
testcase_26 AC 43 ms
33,904 KB
testcase_27 AC 43 ms
34,000 KB
testcase_28 AC 43 ms
34,000 KB
testcase_29 AC 43 ms
33,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.*;

public class Main implements Runnable {
    static ContestScanner in;
    static Writer out;
    public static void main(String[] args) {
        new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
    }

    public void run() {
        Main main = new Main();
        try {
            in = new ContestScanner();
            out = new Writer();
            main.solve();
            out.close();
            in.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    void solve() throws IOException {
        n = in.nextInt();
        m = in.nextInt();
        int p = in.nextInt() - 1;
        int q = in.nextInt() - 1;
        long t = in.nextLong();
        node = new List[n];
        for (int i = 0; i < n; i++) {
            node[i] = new ArrayList<>();
        }
        for (int i = 0; i < m; i++) {
            int a = in.nextInt() - 1;
            int b = in.nextInt() - 1;
            long c = in.nextLong();
            node[a].add(new Pos(b, c));
            node[b].add(new Pos(a, c));
        }
        long[] costS = getCost(0);
        long[] costP = getCost(p);
        long[] costQ = getCost(q);

        long max = -1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                long cost = (costS[i] + costS[j] + Math.max(costP[i] + costP[j], costQ[i] + costQ[j]));
                if (cost > t) continue;
                max = Math.max(max, costS[i] + costS[j] + (t - cost));
                if (costS[i] + costP[i] + costQ[i] + costS[j] + costP[j] + costQ[j] <= t) {
                    max = t;
                }
            }
        }
        System.out.println(max);
    }

    int n, m;
    List<Pos>[] node;
    final long inf = Integer.MAX_VALUE * 2;
    long[] getCost(int s) {
        long[] costs = new long[n];
        boolean[] used = new boolean[n];
        Arrays.fill(costs, inf);
        Queue<Pos> pq = new PriorityQueue<>();
        pq.add(new Pos(s, 0));
        while (!pq.isEmpty()) {
            Pos p = pq.poll();
            if (used[p.p]) {
                continue;
            }
            used[p.p] = true;
            costs[p.p] = p.t;
            for (Pos e: node[p.p]) {
                pq.add(new Pos(e.p, p.t + e.t));
            }
        }
        return costs;
    }
}

class Pos implements Comparable<Pos> {
    long t;
    int p;
    Pos(int p, long t) {
        this.p = p;
        this.t = t;
    }

    @Override
    public int compareTo(Pos o) {
        return Long.compare(t, o.t);
    }
}


@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
    @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
    public void add(T key,int v){put(key,get(key)+v);}
    public void add(T key){put(key,get(key)+1);}
    public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
    public MultiSet<T> merge(MultiSet<T> set)
    {MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
        for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}

class Writer extends PrintWriter{
    public Writer(String filename)throws IOException
    {super(new BufferedWriter(new FileWriter(filename)));}
    public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
    private BufferedReader in;private int c=-2;
    public ContestScanner()throws IOException
    {in=new BufferedReader(new InputStreamReader(System.in));}
    public ContestScanner(String filename)throws IOException
    {in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
    public String nextToken()throws IOException {
        StringBuilder sb=new StringBuilder();
        while((c=in.read())!=-1&&Character.isWhitespace(c));
        while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public String readLine()throws IOException{
        StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
        while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
        return sb.toString();
    }
    public long nextLong()throws IOException,NumberFormatException
    {return Long.parseLong(nextToken());}
    public int nextInt()throws NumberFormatException,IOException
    {return(int)nextLong();}
    public double nextDouble()throws NumberFormatException,IOException
    {return Double.parseDouble(nextToken());}
    public void close() throws IOException {in.close();}
}
0