結果
| 問題 |
No.1932 動く点 P / Moving Point P
|
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2022-05-06 22:24:04 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 2,076 ms / 6,000 ms |
| コード長 | 16,769 bytes |
| コンパイル時間 | 5,191 ms |
| コンパイル使用メモリ | 93,636 KB |
| 実行使用メモリ | 114,848 KB |
| 最終ジャッジ日時 | 2024-07-05 23:42:35 |
| 合計ジャッジ時間 | 36,909 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 11 |
ソースコード
package contest220506;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
import java.util.function.Consumer;
import java.util.function.IntFunction;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class G {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve()
{
int n = ni();
double[][] co = new double[n][];
for(int i = 0;i < n;i++){
co[i] = new double[]{nd(), nd(), nd()/180 * Math.PI};
}
SegmentTreeNode st = new SegmentTreeNode(n, i -> new Node(co[i]),
(a, b, c) -> {
c.M = mul(b.M, a.M);
});
for(int Q = ni();Q > 0;Q--){
int s = ni()-1, t = ni()-1;
double x = nd(), y = nd();
double[] res = st.sum(s, t+1, x, y);
out.println(String.format("%.14f %.14f", res[0], res[1]));
}
}
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;
}
// 普通の累乗計算セット ここまで
// ret[n]=A^(2^n)
public static double[][][] generateP2(double[][] A, int n)
{
double[][][] ret = new double[n+1][][];
ret[0] = A;
for(int i = 1;i <= n;i++)ret[i] = p2(ret[i-1]);
return ret;
}
// A[0]^e*v
// A[n]=A[0]^(2^n)
public static double[] pow(double[][][] A, double[] v, long e)
{
for(int i = 0;e > 0;e>>>=1,i++) {
if((e&1)==1)v = mul(A[i], v);
}
return v;
}
// メモ累乗計算セット ここまで
public static double[][] add(double[][] A, double[][] B)
{
int m = A.length;
int n = A[0].length;
double[][] C = new double[m][n];
for(int i = 0;i < m;i++){
for(int j = 0;j < n;j++){
C[i][j] = A[i][j] + B[i][j];
}
}
return C;
}
public static double[][] sub(double[][] A, double[][] B)
{
int m = A.length;
int n = A[0].length;
double[][] C = new double[m][n];
for(int i = 0;i < m;i++){
for(int j = 0;j < n;j++){
C[i][j] = A[i][j] - B[i][j];
}
}
return C;
}
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;
}
private static class Node
{
double[][] M;
public Node()
{
}
public Node(double[] pqr)
{
double p = pqr[0];
double q = pqr[1];
double r = pqr[2];
M = new double[3][3];
// (C(x-p)+S(y-q))+p
// (-S(x-p)+C(y-q))+q
double C = Math.cos(r);
double S = Math.sin(r);
M[0][0] = C;
M[0][1] = -S;
M[1][0] = S;
M[1][1] = C;
M[0][2] = -C*p+S*q+p;
M[1][2] = -S*p-C*q+q;
M[2][2] = 1;
}
}
public static class SegmentTreeNode {
public int M, H, N;
public Node[] nodes;
@FunctionalInterface
public interface Propagator<T> {
void accept(T c0, T c1, T p);
}
public Propagator<Node> prop2;
public SegmentTreeNode(int n, IntFunction<Node> nodeSupplier, Propagator<Node> prop2)
{
N = n;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
this.prop2 = prop2;
nodes = new Node[M];
for(int i = 0;i < N;i++){
nodes[H+i] = nodeSupplier.apply(i);
}
for(int i = H-1;i >= 1;i--)propagate(i);
}
private void propagate(int cur)
{
if(2*cur >= M)return;
nodes[cur] = prop2(nodes[2*cur], nodes[2*cur+1], nodes[cur]);
}
private Node prop2(Node L, Node R, Node C)
{
if(L != null && R != null){
if(C == null)C = new Node();
prop2.accept(L, R, C);
return C;
}else{
return L != null ? L : R;
}
}
public void update1(int x, Consumer<Node> operate) {
operate.accept(nodes[H+x]);
for(int i = H+x>>>1;i >= 1;i>>>=1)propagate(i);
}
public void update(int l, int r, Consumer<Node> operate) { if(l < r)update(l, r, 0, H, 1, operate); }
protected void update(int l, int r, int cl, int cr, int cur, Consumer<Node> operate)
{
if(l <= cl && cr <= r){
operate.accept(nodes[cur]);
propagate(cur);
}else{
int mid = cl+cr>>>1;
if(cl < r && l < mid){
update(l, r, cl, mid, 2*cur, operate);
}
if(mid < r && l < cr){
update(l, r, mid, cr, 2*cur+1, operate);
}
propagate(cur);
}
}
public double[] sum(int l, int r, double x, double y) {
double[] v = {x, y, 1};
return sum(l, r, v, 0, H, 1);
}
protected double[] sum(int l, int r, double[] v, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
return mul(nodes[cur].M, v);
}else{
int mid = cl+cr>>>1;
if(cl < r && l < mid){
v = sum(l, r, v, cl, mid, 2*cur);
}
if(mid < r && l < cr){
v = sum(l, r, v, mid, cr, 2*cur+1);
}
return v;
}
}
@Override
public String toString()
{
return dfsToString(1, "");
}
private String dfsToString(int cur, String indent)
{
if(cur >= M || nodes[cur] == null)return "";
return dfsToString(2*cur, indent + " ")
+ indent + nodes[cur].toString() + "\n"
+ dfsToString(2*cur+1, indent + " ");
}
}
public static void main(String[] args) {
new G().run();
}
public void run()
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new FastWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-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();
}
private boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
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 long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
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();
}
}
public static class FastWriter
{
private static final int BUF_SIZE = 1<<13;
private final byte[] buf = new byte[BUF_SIZE];
private final OutputStream out;
private int ptr = 0;
private FastWriter(){out = null;}
public FastWriter(OutputStream os)
{
this.out = os;
}
public FastWriter(String path)
{
try {
this.out = new FileOutputStream(path);
} catch (FileNotFoundException e) {
throw new RuntimeException("FastWriter");
}
}
public FastWriter write(byte b)
{
buf[ptr++] = b;
if(ptr == BUF_SIZE)innerflush();
return this;
}
public FastWriter write(char c)
{
return write((byte)c);
}
public FastWriter write(char[] s)
{
for(char c : s){
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
}
return this;
}
public FastWriter write(String s)
{
s.chars().forEach(c -> {
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
});
return this;
}
private static int countDigits(int l) {
if (l >= 1000000000) return 10;
if (l >= 100000000) return 9;
if (l >= 10000000) return 8;
if (l >= 1000000) return 7;
if (l >= 100000) return 6;
if (l >= 10000) return 5;
if (l >= 1000) return 4;
if (l >= 100) return 3;
if (l >= 10) return 2;
return 1;
}
public FastWriter write(int x)
{
if(x == Integer.MIN_VALUE){
return write((long)x);
}
if(ptr + 12 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
private static int countDigits(long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
public FastWriter write(long x)
{
if(x == Long.MIN_VALUE){
return write("" + x);
}
if(ptr + 21 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
public FastWriter write(double x, int precision)
{
if(x < 0){
write('-');
x = -x;
}
x += Math.pow(10, -precision)/2;
// if(x < 0){ x = 0; }
write((long)x).write(".");
x -= (long)x;
for(int i = 0;i < precision;i++){
x *= 10;
write((char)('0'+(int)x));
x -= (int)x;
}
return this;
}
public FastWriter writeln(char c){ return write(c).writeln(); }
public FastWriter writeln(int x){ return write(x).writeln(); }
public FastWriter writeln(long x){ return write(x).writeln(); }
public FastWriter writeln(double x, int precision){ return write(x, precision).writeln(); }
public FastWriter write(int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(IntUnaryOperator f, int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(f.applyAsInt(x));
}
return this;
}
public FastWriter write(LongUnaryOperator f, long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(f.applyAsLong(x));
}
return this;
}
public FastWriter writeln()
{
return write((byte)'\n');
}
public FastWriter writeln(int... xs) { return write(xs).writeln(); }
public FastWriter writeln(long... xs) { return write(xs).writeln(); }
public FastWriter writeln(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, xs).writeln(); }
public FastWriter writeln(char[] line) { return write(line).writeln(); }
public FastWriter writeln(char[]... map) { for(char[] line : map)write(line).writeln();return this; }
public FastWriter writeln(String s) { return write(s).writeln(); }
private void innerflush()
{
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (IOException e) {
throw new RuntimeException("innerflush");
}
}
public void flush()
{
innerflush();
try {
out.flush();
} catch (IOException e) {
throw new RuntimeException("flush");
}
}
public FastWriter print(byte b) { return write(b); }
public FastWriter print(char c) { return write(c); }
public FastWriter print(char[] s) { return write(s); }
public FastWriter print(String s) { return write(s); }
public FastWriter print(int x) { return write(x); }
public FastWriter print(long x) { return write(x); }
public FastWriter print(double x, int precision) { return write(x, precision); }
public FastWriter println(char c){ return writeln(c); }
public FastWriter println(int x){ return writeln(x); }
public FastWriter println(long x){ return writeln(x); }
public FastWriter println(double x, int precision){ return writeln(x, precision); }
public FastWriter print(int... xs) { return write(xs); }
public FastWriter print(long... xs) { return write(xs); }
public FastWriter print(IntUnaryOperator f, int... xs) { return write(f, xs); }
public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
public FastWriter println(int... xs) { return writeln(xs); }
public FastWriter println(long... xs) { return writeln(xs); }
public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, xs); }
public FastWriter println(char[] line) { return writeln(line); }
public FastWriter println(char[]... map) { return writeln(map); }
public FastWriter println(String s) { return writeln(s); }
public FastWriter println() { return writeln(); }
}
public static void trnz(int... o)
{
for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
System.out.println();
}
// print ids which are 1
public static void trt(long... o)
{
Queue<Integer> stands = new ArrayDeque<>();
for(int i = 0;i < o.length;i++){
for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
}
System.out.println(stands);
}
public static void tf(boolean... r)
{
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
public static void tf(boolean[]... b)
{
for(boolean[] r : b) {
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
System.out.println();
}
public void tf(long[]... b)
{
if(INPUT.length() != 0) {
for (long[] r : b) {
for (long x : r) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
System.out.println();
}
}
public void tf(long... b)
{
if(INPUT.length() != 0) {
for (long x : b) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
}
private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}