結果

問題 No.859 路線A、路線B、路線C
ユーザー ziitaziita
提出日時 2019-08-09 22:15:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 46 ms / 1,000 ms
コード長 4,306 bytes
コンパイル時間 3,444 ms
コンパイル使用メモリ 76,652 KB
実行使用メモリ 49,556 KB
最終ジャッジ日時 2023-09-26 18:14:50
合計ジャッジ時間 5,096 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,080 KB
testcase_01 AC 43 ms
49,128 KB
testcase_02 AC 44 ms
49,556 KB
testcase_03 AC 45 ms
49,216 KB
testcase_04 AC 44 ms
49,240 KB
testcase_05 AC 45 ms
49,072 KB
testcase_06 AC 45 ms
49,180 KB
testcase_07 AC 45 ms
49,148 KB
testcase_08 AC 46 ms
49,240 KB
testcase_09 AC 45 ms
49,336 KB
testcase_10 AC 45 ms
49,288 KB
testcase_11 AC 45 ms
49,108 KB
testcase_12 AC 45 ms
49,444 KB
testcase_13 AC 44 ms
49,200 KB
testcase_14 AC 44 ms
49,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    // static int mod = 1_000_000_007;
    int mod = 998244353;
    // long inf = Long.MAX_VALUE/2;
    int inf = Integer.MAX_VALUE/2;

    void solve(){
        long x = ni();
        long y = ni();
        long z = ni();
        long[] res = new long[]{x,y,z};
        String[] s1 = ns().split(" ");
        String[] s2 = ns().split(" ");
        long idx1 = Integer.parseInt(s1[1])-1;
        long idx2 = Integer.parseInt(s2[1])-1;
        int id1 = 0;
        int id2 = 0;
        if(s1[0].equals("B")) id1 = 1;
        if(s1[0].equals("C")) id1 = 2;
        if(s2[0].equals("B")) id2 = 1;
        if(s2[0].equals("C")) id2 = 2;
        long ans = x+y+z;
        long l = idx1;
        l = Math.min(l, res[id1]-l-1 + Math.min(res[(id1+1)%3], res[(id1+2)%3]));
        ans = Math.min(ans, l+idx2+1);
        long r = res[id1] - idx1 - 1;
        r = Math.min(r, idx1 + Math.min(res[(id1+1)%3], res[(id1+2)%3]));
        ans = Math.min(ans, r+(res[id2]-idx2-1)+1);
        if(id1==id2){
            ans = Math.min(ans, Math.abs(idx1-idx2));
        }
        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)); }
 
}
0