#223527 (Java21) No.614 壊れたキャンパス

• 問題: No.614 壊れたキャンパス
• ユーザー: yuya178
• 提出日時: 2017-12-14 15:15:19
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 5,566 bytes
• コンパイル時間: 2,853 ms
• コンパイル使用メモリ: 83,840 KB
• 実行使用メモリ: 83,528 KB
• 最終ジャッジ日時: 2024-05-08 10:03:06
• 合計ジャッジ時間: 7,766 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	54 ms; 50,284 KB
testcase_01	AC	53 ms; 50,240 KB
testcase_02	AC	53 ms; 49,904 KB
testcase_03	AC	53 ms; 50,192 KB
testcase_04	AC	50 ms; 50,128 KB
testcase_05	AC	52 ms; 49,828 KB
testcase_06	WA	-
testcase_07	AC	52 ms; 50,144 KB
testcase_08	TLE	-
testcase_09	--	-
testcase_10	--	-
testcase_11	--	-
testcase_12	--	-
testcase_13	--	-
testcase_14	--	-
testcase_15	--	-
testcase_16	--	-
testcase_17	--	-
testcase_18	--	-
testcase_19	--	-

ソースコード

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 = Integer.MAX_VALUE;

    void solve(){
        int n = ni();
        int m = ni();
        int k = ni();
        int s = ni();
        int t = ni();
        if(m==0){
            if(n==1){
                out.println(Math.abs(s-t));
                return;
            }
            out.println(-1);
            return;
        }
        int[][] root = new int[m][3];
        for(int i = 0; i < m; i++){
            root[i]= new int[]{ni()-1, ni(), ni()};
        }
        Arrays.sort(root, new Comparator<int[]>() {
            public int compare(int[] a, int[] b) {
                if(a[0]==b[0]) return a[2]-b[2];
                return a[0] - b[0];
            }
        });
        int a = 0;
        int z = 0;
        long[] distp = new long[m+1];
        ArrayList<Integer>arrp = new ArrayList<>();
        for(int v = 0; v < n-1; v++){
            ArrayList<Integer>arr = new ArrayList<>();
            long[] dist = new long[m+1];
            if(root[z][0]!=a){
                out.println(-1);
                return;
            }
            long prev = inf;
            int o = 0;
            while(root[z][0]==a){
                long res = Long.MAX_VALUE;
                if(a==0){
                    res = Math.abs(s-root[z][1]);
                }
                for(int i = 0; i < arrp.size(); i++){
                    res = Math.min(Math.abs(root[z][1]-arrp.get(i))+distp[i], res);
                }
                if(root[z][2]==prev){
                    res = Math.min(res, dist[o]);
                    arr.remove(arr.size()-1);
                    o--;
                }
                arr.add(root[z][2]);
                dist[o] = res;
                prev = root[z][2];
                z++;
                o++;
                if(z>=m) break;
            }
            arrp = arr;
            distp = dist;
            // for(int i = 0; i < arrp.size(); i++){
            //     out.println(arrp.get(i)+" "+distp[i]);
            // }
            // out.println();
            a++;
            if(a>=n-1) break;
        }
        long ans = Long.MAX_VALUE;
        for(int i = 0; i < arrp.size(); i++){
            // out.println(x[0]+" "+x[1]);
            ans = Math.min(ans, Math.abs(t-arrp.get(i))+distp[i]);
        }
        out.println(ans);
    }

    
    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)); }
 
}