#15292 (Java) No.126 2基のエレベータ

• 問題: No.126 2基のエレベータ
• ユーザー: t8m8⛄️
• 提出日時: 2015-03-12 11:51:54
• 言語: Java (openjdk 23)
• 結果: WA
• 実行時間: -
• コード長: 3,969 bytes
• コンパイル時間: 5,404 ms
• コンパイル使用メモリ: 78,708 KB
• 実行使用メモリ: 37,056 KB
• 最終ジャッジ日時: 2024-06-24 18:33:24
• 合計ジャッジ時間: 7,042 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 14 WA * 13

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
//No.126 2基のエレベータ
import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
public class No126 {
    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);
    static void solve(){
        int a = nextInt();
        int b = nextInt();
        int s = nextInt();
        if (s == 1) {
            out.println(a != 0 ? a+1 : 2);
        }else {
            if (abs(a-s) <= abs(b-s)) {
                out.println((abs(a-s)+s));
            }else {
                if (b <= s && s < a) {
                    out.println((a-b+1));
                }else if (a < s && s <= b) {
                    out.println((b+1));
                }else if (a < b && b <= s) {
                    out.println(2*(s-b)+b);
                }else if (s <= b && b < a) {
                    out.println(max((b-s)+1+(a-s+1)+(s-1),(b-s)+(a-s)+a));
                }
            }
        }
    }
    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();
        solve();
        out.flush();
        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }
    static void trace(Object... o) { System.out.println(deepToString(o));}
    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;
    static 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;
    }
    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}
    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}
    static boolean hasNext() {skip(); return hasNextByte();}
    static 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();
    }
    static 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();
        }
    }
    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }
    static double nextDouble() {
        return Double.parseDouble(next());
    }
    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }
    static 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();
    }
    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX