/* このコード、と~おれ! Be accepted! ∧_∧  (。・ω・。)つ━☆・*。 ⊂   ノ    ・゜+.  しーJ   °。+ *´¨)          .· ´¸.·*´¨) ¸.·*¨)           (¸.·´ (¸.·'* ☆ */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /*多倍長整数/cpp_intで宣言 #include using namespace boost::multiprecision; */ #define rep(i, n) for(int i = 0; i < (n); ++i) #define rep1(i, n) for(int i = 1; i <= (n); ++i) #define rep2(i, n) for(int i = 2; i < (n); ++i) #define repr(i, n) for(int i = n; i >= 0; --i) #define reprm(i, n) for(int i = n - 1; i >= 0; --i) #define printynl(a) printf(a ? "yes\n" : "no\n") #define printyn(a) printf(a ? "Yes\n" : "No\n") #define printYN(a) printf(a ? "YES\n" : "NO\n") #define printim(a) printf(a ? "possible\n" : "imposible\n") #define printdb(a) printf("%.50lf\n", a) //少数出力 #define printLdb(a) printf("%.50Lf\n", a) //少数出力 #define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ) #define prints(s) printf("%s\n", s.c_str()) //string出力 #define all(x) (x).begin(), (x).end() #define allsum(a, b, c) ((a + b) * c / 2.0) //等差数列の和、初項,末項,項数 #define pb push_back #define priq priority_queue #define rpriq priq, greater> #define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI) #define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L) #define Please return #define AC 0 #define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */ using ll = long long; constexpr int INF = 1073741823; constexpr int MINF = -1073741823; constexpr ll LINF = ll(4661686018427387903); constexpr ll MOD = 1000000007; const long double PI = acosl(-1.0L); using namespace std; void scans(string& str) { char c; str = ""; scanf("%c", &c); if (c == '\n')scanf("%c", &c); while (c != '\n' && c != -1 && c != ' ') { str += c; scanf("%c", &c); } } void scanc(char& str) { char c; scanf("%c", &c); if (c == -1)return; while (c == '\n') { scanf("%c", &c); } str = c; } double acot(double x) { return PI / 2 - atan(x); } ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll number1, ll number2) { return number1 / gcd(number1, number2) * number2; } ll LSB(ll n) { return (n & (-n)); } /*-----------------------------------------ここからコード-----------------------------------------*/ inline vector> f(const vector>& a, const vector>& b) { vector> res(3, vector(3)); res[0][0] = a[0][0] * b[0][0] + a[0][1] * b[1][0]; res[0][1] = a[0][0] * b[0][1] + a[0][1] * b[1][1]; res[0][2] = a[0][0] * b[0][2] + a[0][1] * b[1][2] + a[0][2]; res[1][0] = a[1][0] * b[0][0] + a[1][1] * b[1][0]; res[1][1] = a[1][0] * b[0][1] + a[1][1] * b[1][1]; res[1][2] = a[1][0] * b[0][2] + a[1][1] * b[1][2] + a[1][2]; res[2][0] = 0; res[2][1] = 0; res[2][2] = 1; return res; } int main() { int n; scanf("%d", &n); vector>> R(n + 1, vector>(3, vector(3))); rep(i, 3)rep(j, 3)R[0][i][j] = (i == j); vector> tmp(3, vector(3)); long double p, q, r; rep(i, n) { scanf("%Lf%Lf%Lf", &p, &q, &r); r = deg_to_rad(r); tmp[0][0] = cosl(r); tmp[0][1] = -sinl(r); tmp[0][2] = q * sinl(r) - p * cosl(r) + p; tmp[1][0] = sinl(r); tmp[1][1] = cosl(r); tmp[1][2] = -p * sinl(r) - q * cosl(r) + q; tmp[2][0] = 0; tmp[2][1] = 0; tmp[2][2] = 1; R[i + 1] = f(tmp, R[i]); } int Q; scanf("%d", &Q); int s, t; long double x, y; rep(i, Q) { scanf("%d%d%Lf%Lf", &s, &t, &x, &y); --s; tmp[0][0] = (R[s][1][1] / (R[s][0][0] * R[s][1][1] - R[s][0][1] * R[s][1][0])); tmp[0][1] = (R[s][0][1] / (R[s][0][1] * R[s][1][0] - R[s][0][0] * R[s][1][1])); tmp[0][2] = ((R[s][0][1] * R[s][1][2] - R[s][0][2] * R[s][1][1]) / (R[s][0][0] * R[s][1][1] - R[s][0][1] * R[s][1][0])); tmp[1][0] = (R[s][1][0] / (R[s][0][1] * R[s][1][0] - R[s][0][0] * R[s][1][1])); tmp[1][1] = (R[s][0][0] / (R[s][0][0] * R[s][1][1] - R[s][0][1] * R[s][1][0])); tmp[1][2] = ((R[s][0][2] * R[s][1][0] - R[s][0][0] * R[s][1][2]) / (R[s][0][0] * R[s][1][1] - R[s][0][1] * R[s][1][0])); tmp[2][0] = 0; tmp[2][1] = 0; tmp[2][2] = 1; tmp = f(R[t], tmp); printf("%Lf %Lf\n", tmp[0][2] + tmp[0][0] * x + tmp[0][1] * y, tmp[1][2] + tmp[1][0] * x + tmp[1][1] * y); } Please AC; }