結果

問題 No.172 UFOを捕まえろ
ユーザー k_6101k_6101
提出日時 2020-08-08 17:48:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 51 ms / 5,000 ms
コード長 3,786 bytes
コンパイル時間 2,259 ms
コンパイル使用メモリ 89,064 KB
実行使用メモリ 50,360 KB
最終ジャッジ日時 2024-04-09 21:22:03
合計ジャッジ時間 4,502 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
50,008 KB
testcase_01 AC 51 ms
50,228 KB
testcase_02 AC 49 ms
49,916 KB
testcase_03 AC 50 ms
50,328 KB
testcase_04 AC 49 ms
50,292 KB
testcase_05 AC 48 ms
50,328 KB
testcase_06 AC 48 ms
50,284 KB
testcase_07 AC 49 ms
50,028 KB
testcase_08 AC 50 ms
50,260 KB
testcase_09 AC 50 ms
50,040 KB
testcase_10 AC 48 ms
50,156 KB
testcase_11 AC 49 ms
49,912 KB
testcase_12 AC 49 ms
50,360 KB
testcase_13 AC 49 ms
50,356 KB
testcase_14 AC 49 ms
50,020 KB
testcase_15 AC 49 ms
50,288 KB
testcase_16 AC 48 ms
50,340 KB
testcase_17 AC 50 ms
50,276 KB
testcase_18 AC 49 ms
50,336 KB
testcase_19 AC 50 ms
50,276 KB
testcase_20 AC 50 ms
50,268 KB
testcase_21 AC 49 ms
50,064 KB
testcase_22 AC 48 ms
50,320 KB
testcase_23 AC 50 ms
50,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}
	// ======================================================================
	public void solve() {
		int x = ni();
		int y = ni();
		int r = ni();
		double diff = (double)r / Math.sin(Math.toRadians(45));
		int d = 0;
		if(Math.floor(diff) < diff)		d = (int)Math.floor(diff) + 1;
		else							d = (int)diff;
		out.println(Math.abs(x) + Math.abs(y) + d);
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);
	
	// Scanner
	private FastScanner scan = new FastScanner();
	int ni(){ return scan.nextInt();}
	int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
	int[][] ni(int y, int x){int[][] a = new int[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
	long nl(){return scan.nextLong();}
	long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
	long[][] nl(int y, int x){long[][] a = new long[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
	String ns(){return scan.next();}
	String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
	String[][] ns(int y, int x){String[][] a = new String[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
}
class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public 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();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
}
0