Submission #1834979
Source Code Expand
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = Integer.MAX_VALUE; void solve(){ int a = ni(); int b = ni(); int c = ni(); double left = 0; double right = 100000000; int k = 0; while(left<right){ double res = (left+right)/2; if(f(a,b,c,res)>100) right = res; else left = res; k++; if(k>1000000) break; } // out.println(f(a,b,c,left)); out.println(left); } double f(int a, int b, int c, double t){ double k = a*t + b*Math.sin(c*t*Math.PI); return k; } 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)); } }
Submission Info
Submission Time | |
---|---|
Task | D - 高橋君ボール1号 |
User | yuya178 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 4002 Byte |
Status | AC |
Exec Time | 237 ms |
Memory | 23636 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0.txt, example_1.txt |
All | example_0.txt, example_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, special_0.txt, special_1.txt, special_2.txt, example_0.txt, example_1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0.txt | AC | 215 ms | 21588 KB |
example_1.txt | AC | 221 ms | 18516 KB |
random_0.txt | AC | 219 ms | 21460 KB |
random_1.txt | AC | 222 ms | 21588 KB |
random_2.txt | AC | 222 ms | 16212 KB |
random_3.txt | AC | 220 ms | 21588 KB |
random_4.txt | AC | 222 ms | 19412 KB |
random_5.txt | AC | 222 ms | 19412 KB |
random_6.txt | AC | 221 ms | 20180 KB |
random_7.txt | AC | 237 ms | 20820 KB |
random_8.txt | AC | 222 ms | 21460 KB |
random_9.txt | AC | 221 ms | 18516 KB |
special_0.txt | AC | 221 ms | 19796 KB |
special_1.txt | AC | 233 ms | 23636 KB |
special_2.txt | AC | 214 ms | 19796 KB |