結果
問題 | No.48 ロボットの操縦 |
ユーザー | threepipes_s |
提出日時 | 2015-02-17 03:34:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 53 ms / 5,000 ms |
コード長 | 2,118 bytes |
コンパイル時間 | 2,623 ms |
コンパイル使用メモリ | 79,260 KB |
実行使用メモリ | 37,360 KB |
最終ジャッジ日時 | 2024-11-21 18:16:11 |
合計ジャッジ時間 | 4,241 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
37,024 KB |
testcase_01 | AC | 52 ms
37,288 KB |
testcase_02 | AC | 50 ms
37,340 KB |
testcase_03 | AC | 50 ms
37,240 KB |
testcase_04 | AC | 50 ms
37,044 KB |
testcase_05 | AC | 48 ms
37,016 KB |
testcase_06 | AC | 49 ms
37,016 KB |
testcase_07 | AC | 51 ms
37,300 KB |
testcase_08 | AC | 51 ms
37,020 KB |
testcase_09 | AC | 53 ms
37,300 KB |
testcase_10 | AC | 53 ms
37,224 KB |
testcase_11 | AC | 53 ms
37,128 KB |
testcase_12 | AC | 49 ms
37,276 KB |
testcase_13 | AC | 51 ms
37,264 KB |
testcase_14 | AC | 50 ms
36,980 KB |
testcase_15 | AC | 45 ms
37,056 KB |
testcase_16 | AC | 47 ms
37,020 KB |
testcase_17 | AC | 48 ms
37,120 KB |
testcase_18 | AC | 51 ms
36,908 KB |
testcase_19 | AC | 49 ms
37,100 KB |
testcase_20 | AC | 48 ms
37,360 KB |
testcase_21 | AC | 49 ms
37,164 KB |
testcase_22 | AC | 51 ms
36,652 KB |
testcase_23 | AC | 52 ms
36,980 KB |
testcase_24 | AC | 49 ms
37,224 KB |
ソースコード
import java.io.BufferedReader; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.List; import java.util.TreeSet; public class Main { public static boolean result[]; public static int dp[][]; public static void main(String[] args) throws NumberFormatException, IOException{ ContestScanner in = new ContestScanner(); int x = in.nextInt(); int y = in.nextInt(); int l = in.nextInt(); if(x == 0 && y == 0){ System.out.println(0); return; } int count = 0; if(y < 0){ count = 2; }else if(x != 0) count = 1; x = Math.abs(x); y = Math.abs(y); count += x/l+(x%l==0?0:1); count += y/l+(y%l==0?0:1); System.out.println(count); } } class MyComp implements Comparator<int[]>{ public int compare(int[] a, int[] b) { return a[0] - b[0]; } } class Reverse implements Comparator<Integer>{ public int compare(Integer arg0, Integer arg1) { return arg1 - arg0; } } class Node{ int id; List<Node> edge = new ArrayList<Node>(); public Node(int id){ this.id = id; } public void createEdge(Node node){ edge.add(node); } } class ContestScanner{ private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(System.in)); } public ContestScanner(String filename) throws FileNotFoundException{ reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename))); } public String nextToken() throws IOException{ if(line == null || line.length <= idx){ line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } 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()); } }