結果

問題 No.620 ぐるぐるぐるりん
ユーザー yuya178yuya178
提出日時 2017-12-20 01:32:49
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,931 bytes
コンパイル時間 3,075 ms
コンパイル使用メモリ 87,236 KB
実行使用メモリ 57,652 KB
最終ジャッジ日時 2024-12-16 02:57:58
合計ジャッジ時間 11,364 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 96 ms
40,144 KB
testcase_02 WA -
testcase_03 AC 85 ms
40,028 KB
testcase_04 AC 105 ms
39,988 KB
testcase_05 AC 90 ms
40,064 KB
testcase_06 AC 87 ms
38,312 KB
testcase_07 AC 101 ms
40,088 KB
testcase_08 WA -
testcase_09 AC 86 ms
38,144 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 84 ms
38,260 KB
testcase_25 AC 89 ms
38,268 KB
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 n = ni();
        for(int i = 0; i < n; i++){
            String[] s = ns().split(" ");
            int t = Integer.parseInt(s[0]);
            double p = Double.parseDouble(s[1]);
            double w = Double.parseDouble(s[2]);
            double v = Double.parseDouble(s[3]);
            double gx = Double.parseDouble(s[4]);
            double gy = Double.parseDouble(s[5]);
            double k = Math.sqrt((1+v)*(1+v)+w*w);
            double theta = Math.acos((1+v)/k);
            double a = gx/Math.sqrt(gx*gx+gy*gy);
            double b = gy/Math.sqrt(gx*gx+gy*gy);
            double[] dx = new double[100];
            double[] dy = new double[100]; 
            dx[0] = 1;
            dy[0] = 0;
            double[] ux = new double[100];
            double[] uy = new double[100];
            for(int j = 1; j <= t; j++){
                double r = Math.sqrt(gx*gx+gy*gy)/Math.pow(k,t-j);
                double x = r*(a*Math.cos((t-j)*theta)+b*Math.sin((t-j)*theta));
                double y = r*(b*Math.cos((t-j)*theta)-a*Math.sin((t-j)*theta));
                ux[j-1] = x-(1+v)*dx[j-1]+w*dy[j-1];
                uy[j-1] = y-(1+v)*dy[j-1]-w*dx[j-1];
                if(ux[j-1]*ux[j-1]+uy[j-1]*uy[j-1]>p){
                    ux[j-1] = 0;
                    uy[j-1] = 0;
                } 
                dx[j] = (1+v)*dx[j-1]-w*dy[j-1]+ux[j-1];
                dy[j] = (1+v)*dy[j-1]+w*dx[j-1]+uy[j-1];
                out.println(ux[j-1]+" "+uy[j-1]);
                // out.println(dx[j]+" "+dy[j]);
            }
            // out.println(dx[t]+" "+dy[t]);
        }

    }
    
    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)); }
 
}
0