結果
| 問題 | No.620 ぐるぐるぐるりん |
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2017-12-19 23:40:07 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,159 bytes |
| 記録 | |
| コンパイル時間 | 4,825 ms |
| コンパイル使用メモリ | 91,028 KB |
| 実行使用メモリ | 114,524 KB |
| 最終ジャッジ日時 | 2024-12-16 02:28:37 |
| 合計ジャッジ時間 | 19,668 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 WA * 2 |
| other | AC * 7 WA * 17 TLE * 4 |
ソースコード
package adv2017;
import java.awt.geom.Point2D;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
// greedy
public class N620_5 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int U = ni();
if(!(1 <= U && U <= 1000))throw new AssertionError("U");
for(;U > 0;U--){
int T = ni();
double P = nd();
double omega = nd();
double v = nd();
double gx = nd();
double gy = nd();
if(!(1 <= T && T <= 15))throw new AssertionError("T");
if(!(0 <= P && P <= 1e9))throw new AssertionError("P");
if(!(-10 <= omega && omega <= 10))throw new AssertionError("omega");
if(!(-10 <= v && v <= 10))throw new AssertionError("v");
if(!(-100 <= gx && gx <= 100))throw new AssertionError("gx");
if(!(-100 <= gy && gy <= 100))throw new AssertionError("gy");
/*
(1+v -ω ux)
(ω 1+v uy)
(0 0 1)
*
*/
double[][] M = {
{1+v, -omega},
{omega, 1+v}
};
double[][] E = {
{1, 0},
{0, 1}
};
double[][][] MS = new double[T+1][][];
MS[0] = E;
for(int i = 1;i <= T;i++){
MS[i] = mul(MS[i-1], M);
}
double[] w = new double[2*T];
// double pre = score(omega, v, w, T, gx, gy, P);
for(int rep = 0;rep < 20;rep++){
for(int i = 0;i < 2*T;i++){
double low = -33000, high = 33000;
for(int r = 0;r < 60;r++){
double nl = low + (high - low)/3;
double nh = high + (low - high)/3;
w[i] = nl;
double vl = score(omega, v, w, T, gx, gy, P);
w[i] = nh;
double vh = score(omega, v, w, T, gx, gy, P);
if(vl < vh){
high = nh;
}else{
low = nl;
}
}
w[i] = low;
}
}
// check(omega, v, w, T, gx, gy, P);
for(int i = 0;i < 2*T;i+=2){
out.print(dtos(w[i], 14));
out.print(" ");
out.println(dtos(w[i+1], 14));
// out.printf("%.14f %.14f\n", x[i], x[i+1]);
}
}
}
public static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if(x < 0){
sb.append('-');
x = -x;
}
x += Math.pow(10, -n)/2;
// if(x < 0){ x = 0; }
sb.append((long)x);
sb.append(".");
x -= (long)x;
for(int i = 0;i < n;i++){
x *= 10;
sb.append((int)x);
x -= (int)x;
}
return sb.toString();
}
static double score(double omega, double V, double[] x, double T, double gx, double gy, double P)
{
double[] v = new double[]{1, 0, 1};
double used = 0;
for(int i = 0;i < T;i++){
used += x[i*2]*x[i*2] + x[i*2+1]*x[i*2+1];
double[][] M = {
{1+V, -omega, x[i*2]},
{omega, 1+V, x[i*2+1]},
{0, 0, 1}
};
v = mul(M, v);
}
return used*used + Math.max(1e-10, (v[0]-gx)*(v[0]-gx)+(v[1]-gy)*(v[1]-gy))*100000;
}
static void check(double omega, double V, double[] x, double T, double gx, double gy, double P)
{
double[] v = new double[]{1, 0, 1};
double used = 0;
for(int i = 0;i < T;i++){
used += x[i*2]*x[i*2] + x[i*2+1]*x[i*2+1];
double[][] M = {
{1+V, -omega, x[i*2]},
{omega, 1+V, x[i*2+1]},
{0, 0, 1}
};
v = mul(M, v);
}
tr(used, P);
assert used <= P;
tr(v, gx, gy);
if(!(Point2D.distance(v[0], v[1], gx, gy) <= 1e-4))throw new RuntimeException();
}
public static double[] solve(double[][] a, double[] c)
{
int n = a.length;
int[] ps = new int[n];
for(int i = 0;i < n;i++)ps[i] = i;
// Forward Elimination
for(int i = 0;i < n;i++){
int pivot = -1;
int from = -1;
double amax = 0;
for(int j = i;j < n;j++){
if(Math.abs(a[ps[j]][i]) > amax){
amax = Math.abs(a[ps[j]][i]);
pivot = ps[j];
from = j;
}
}
if(pivot == -1)return null;
int d = ps[i]; ps[i] = ps[from]; ps[from] = d;
for(int j = i+1;j < n;j++){
a[ps[i]][j] /= a[ps[i]][i];
}
c[ps[i]] /= a[ps[i]][i];
a[ps[i]][i] = 1.0;
for(int j = i+1;j < n;j++){
for(int k = i+1;k < n;k++){
a[ps[j]][k] -= a[ps[j]][i] * a[ps[i]][k];
}
c[ps[j]] -= a[ps[j]][i] * c[ps[i]];
a[ps[j]][i] = 0.0;
}
}
// Back Substitution
for(int i = n-1;i >= 0;i--){
for(int j = i-1;j >= 0;j--){
c[ps[j]] -= a[ps[j]][i] * c[ps[i]];
}
}
double[] ret = new double[n];
for(int i = 0;i < n;i++){
ret[i] = c[ps[i]];
}
return ret;
}
public static double[][] mul(double[][] A, double[][] B)
{
assert A[0].length == B.length;
int m = A.length;
int n = A[0].length;
int o = B[0].length;
double[][] C = new double[m][o];
for(int i = 0;i < m;i++){
for(int k = 0;k < n;k++){
for(int j = 0;j < o;j++){
C[i][j] += A[i][k] * B[k][j];
}
}
}
return C;
}
public static double[] mul(double[][] A, double[] v)
{
int m = A.length;
int n = v.length;
double[] w = new double[m];
for(int i = 0;i < m;i++){
double sum = 0;
for(int k = 0;k < n;k++){
sum += A[i][k] * v[k];
}
w[i] = sum;
}
return w;
}
public static double[][] p2(double[][] A)
{
int n = A.length;
double[][] C = new double[n][n];
for(int i = 0;i < n;i++){
for(int k = 0;k < n;k++){
for(int j = 0;j < n;j++){
C[i][j] += A[i][k] * A[k][j];
}
}
}
return C;
}
// A^e*v
public static double[] pow(double[][] A, double[] v, long m)
{
double[][] mu = A;
double[] r = v;
for(;m > 0;m>>>=1){
if((m&1)==1)r = mul(mu, r);
mu = p2(mu);
}
return r;
}
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");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new N620_5().run(); }
private byte[] inbuf = new byte[1024];
public 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))){ // when nextLine, (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 int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
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[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
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)); }
}