結果
問題 | No.126 2基のエレベータ |
ユーザー | a3636tako |
提出日時 | 2016-07-22 20:01:27 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,370 bytes |
コンパイル時間 | 2,298 ms |
コンパイル使用メモリ | 78,392 KB |
実行使用メモリ | 50,212 KB |
最終ジャッジ日時 | 2024-11-06 08:46:04 |
合計ジャッジ時間 | 5,169 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
49,768 KB |
testcase_01 | AC | 56 ms
50,108 KB |
testcase_02 | WA | - |
testcase_03 | AC | 55 ms
50,200 KB |
testcase_04 | AC | 54 ms
49,912 KB |
testcase_05 | AC | 55 ms
49,956 KB |
testcase_06 | AC | 55 ms
49,744 KB |
testcase_07 | AC | 60 ms
49,756 KB |
testcase_08 | AC | 56 ms
50,024 KB |
testcase_09 | AC | 60 ms
50,120 KB |
testcase_10 | AC | 58 ms
50,012 KB |
testcase_11 | AC | 57 ms
49,768 KB |
testcase_12 | AC | 58 ms
49,764 KB |
testcase_13 | AC | 54 ms
50,032 KB |
testcase_14 | AC | 54 ms
49,900 KB |
testcase_15 | AC | 54 ms
50,036 KB |
testcase_16 | AC | 54 ms
49,912 KB |
testcase_17 | AC | 55 ms
49,968 KB |
testcase_18 | AC | 55 ms
50,212 KB |
testcase_19 | AC | 55 ms
49,872 KB |
testcase_20 | AC | 54 ms
49,936 KB |
testcase_21 | AC | 54 ms
50,112 KB |
testcase_22 | AC | 55 ms
49,692 KB |
testcase_23 | AC | 55 ms
50,096 KB |
testcase_24 | AC | 55 ms
49,748 KB |
testcase_25 | AC | 55 ms
50,084 KB |
testcase_26 | AC | 56 ms
50,056 KB |
testcase_27 | AC | 55 ms
49,896 KB |
testcase_28 | AC | 55 ms
49,916 KB |
testcase_29 | AC | 55 ms
49,952 KB |
ソースコード
import java.io.*; import java.util.*; public class Main{ public void solve(){ int A = nextInt(); int B = nextInt(); int S = nextInt(); if(Math.abs(A - S) <= Math.abs(B - S)){ out.println(Math.abs(A - S) + S); }else if(A == 0){ out.println(Math.abs(B - S) + S - 1 + 2); }else{ int a1 = Math.abs(B - S) + Math.abs(A - S) + A; int a2 = Math.abs(B - S) + S - 1 + A; out.println(Math.min(a2, a1)); } } public boolean check(String str, int idx){ if(idx + 3 >= str.length()) return false; if(str.charAt(idx) != 'i') return false; if(str.charAt(idx + 1) != 'w') return false; if(str.charAt(idx + 2) != 'i') return false; return true; } private static PrintWriter out; public static void main(String[] args){ out = new PrintWriter(System.out); new Main().solve(); out.flush(); } public static int nextInt(){ int num = 0; String str = next(); boolean minus = false; int i = 0; if(str.charAt(0) == '-'){ minus = true; i++; } int len = str.length(); for(;i < len; i++){ char c = str.charAt(i); if(!('0' <= c && c <= '9')) throw new RuntimeException(); num = num * 10 + (c - '0'); } return minus ? -num : num; } public static long nextLong(){ long num = 0; String str = next(); boolean minus = false; int i = 0; if(str.charAt(0) == '-'){ minus = true; i++; } int len = str.length(); for(;i < len; i++){ char c = str.charAt(i); if(!('0' <= c && c <= '9')) throw new RuntimeException(); num = num * 10l + (c - '0'); } return minus ? -num : num; } public static String next(){ int c; while(!isAlNum(c = read())){} StringBuilder build = new StringBuilder(); build.append((char)c); while(isAlNum(c = read())){ build.append((char)c); } return build.toString(); } private static byte[] inputBuffer = new byte[1024]; private static int bufferLength = 0; private static int bufferIndex = 0; private static int read(){ if(bufferLength < 0) throw new RuntimeException(); if(bufferIndex >= bufferLength){ try{ bufferLength = System.in.read(inputBuffer); bufferIndex = 0; }catch(IOException e){ throw new RuntimeException(e); } if(bufferLength <= 0) return (bufferLength = -1); } return inputBuffer[bufferIndex++]; } private static boolean isAlNum(int c){ return '!' <= c && c <= '~'; } }