結果
| 問題 |
No.1932 動く点 P / Moving Point P
|
| コンテスト | |
| ユーザー |
 FF256grhy
|
| 提出日時 | 2022-05-07 00:33:45 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2,301 ms / 6,000 ms |
| コード長 | 9,513 bytes |
| コンパイル時間 | 3,036 ms |
| コンパイル使用メモリ | 220,380 KB |
| 最終ジャッジ日時 | 2025-01-29 04:20:07 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 11 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++)
#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++)
#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++)
#define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--)
#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--)
#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--)
#define inc(i, n) incIX(i, 0, n)
#define dec(i, n) decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };
auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); };
auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); };
auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); };
auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); };
auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };
using LL = long long int;
using LD = long double;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
#define RV(a) reverse(ALL(a))
#define ST(a) sort(ALL(a))
#define RST(a) sort(RALL(a))
#define SC static_cast
#define SI(a) SC<int>(a.size())
#define SL(a) SC<LL>(a.size())
#define RF(e, ...) for(auto && e: __VA_ARGS__)
#define SF(a, ...) for(auto && [__VA_ARGS__]: a)
#define until(e) while(not(e))
#define if_not(e) if(not(e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }
#define IN(...) __VA_ARGS__; in(__VA_ARGS__)
struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;
void out_([[maybe_unused]] string const & s) { }
template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }
template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }
auto outF = [](array<string, 3> const & s, auto const & ... a) { * OS << s[0]; out_(s[1], a ...); * OS << s[2] << flush; };
auto outN = [](auto const & ... a) { outF({ "", "" , "" }, a ...); };
auto outS = [](auto const & ... a) { outF({ "", " " , " " }, a ...); };
auto outL = [](auto const & ... a) { outF({ "", "\n", "\n" }, a ...); };
auto outSN = [](auto const & ... a) { outF({ "", " " , "" }, a ...); };
auto outNL = [](auto const & ... a) { outF({ "", "" , "\n" }, a ...); };
auto outSL = [](auto const & ... a) { outF({ "", " " , "\n" }, a ...); };
auto outD = [](auto const & ... a) { outF({ "[ ", " : " , " ]\n" }, a ...); };
auto out = outSL;
template<typename A > void disp_(A const & a) { * OS << a; }
template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s; disp_(e, t ...); } }
auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };
auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };
auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); };
template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; }
template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " "; } return os; }
template<typename A > auto make_v(A a) { return a; }
template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }
template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }
template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; }
template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " "; } return os; }
template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; }
template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }
template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t); } }
template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }
template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; }
template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }
// ---- ----
template<typename T> class SegmentTree {
private:
int n, s;
vector<T> a;
function<T(T &, T &)> f;
T e;
bool ok;
void shift(int & p) {
assert(inIX(p, 0, n));
p += s;
}
public:
SegmentTree() { n = 0; }
SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
void init(int nn, function<T(T &, T &)> ff, T ee) {
n = nn;
f = ff;
e = ee;
s = 1;
while(s < n) { s *= 2; }
a = vector<T>(2 * s, e);
ok = true;
}
void apply(int p, function<void(T &)> g) {
shift(p);
g(a[p]);
while(p > 1) {
p /= 2;
a[p] = f(a[2 * p], a[2 * p + 1]);
}
}
T fold_IX(int l, int r) {
assert(ok);
assert(inII(l, 0, n)); l += s;
assert(inII(r, 0, n)); r += s; r--;
T x = e, y = e;
while(l <= r) {
if(l % 2 == 1) { x = f(x, a[l]); l++; }
if(r % 2 == 0) { y = f(a[r], y); r--; }
l /= 2;
r /= 2;
}
return f(x, y);
}
T fold_II(int l, int r) { return fold_IX(l + 0, r + 1); }
T fold_XI(int l, int r) { return fold_IX(l + 1, r + 1); }
T fold_XX(int l, int r) { return fold_IX(l + 1, r + 0); }
const T & operator[](int p) {
shift(p);
return a[p];
}
T & ref(int p) {
shift(p);
ok = false;
return a[p];
}
void calc() {
dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
ok = true;
}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }
// ----
template<typename T, T(* PLUS)(T, T), T(* MULT)(T, T), T(* ZERO)(), T(* UNIT)()> struct Matrix_ {
int h, w;
vector<vector<T>> v;
explicit Matrix_(int h = 1): h(h), w(h), v(h, vector<T>(w, ZERO())) { }
explicit Matrix_(int h, int w): h(h), w(w), v(h, vector<T>(w, ZERO())) { }
Matrix_(vector<vector<T>> const & v): h(SI(v)), w(SI(v[0])), v(v) {
inc(i, h) { assert(SI(v[i]) == w); }
}
vector<T> const & operator[](int i) const { return v.at(i); }
vector<T> & operator[](int i) { return v.at(i); }
static Matrix_ unit(int n) {
Matrix_ a(n);
inc(i, n) { a[i][i] = UNIT(); }
return a;
}
friend Matrix_ operator*(Matrix_ const & a, Matrix_ const & b) {
assert(a.w == b.h);
Matrix_ c(a.h, b.w);
inc(i, a.h) {
inc(j, b.w) {
inc(k, a.w) {
c[i][j] = PLUS(c[i][j], MULT(a[i][k], b[k][j]));
}
}
}
return c;
}
friend Matrix_ operator^(Matrix_ a, LL b) {
assert(a.h == a.w);
assert(b >= 0);
auto p = Matrix_::unit(a.h);
while(b) {
if(b & 1) { p *= a; }
a *= a;
b >>= 1;
}
return p;
}
friend Matrix_ & operator*=(Matrix_ & a, Matrix_ const & b) { return (a = a * b); }
friend Matrix_ & operator^=(Matrix_ & a, LL b) { return (a = a ^ b); }
friend Matrix_ & operator*=(Matrix_ & a, T b) {
inc(i, a.h) {
inc(j, a.w) {
a[i][j] = MULT(a[i][j], b);
}
}
return a;
}
friend Matrix_ operator*(Matrix_ a, T b) { return (a *= b); }
friend Matrix_ operator*(T b, Matrix_ a) { return (a *= b); }
friend ostream & operator<<(ostream & s, Matrix_ const & a) {
inc(i, a.h) { s << a[i] << endl; }
return s;
}
};
template<typename T> T PLUS(T a, T b) { return a + b; };
template<typename T> T MULT(T a, T b) { return a * b; };
template<typename T> T ZERO() { return 0; };
template<typename T> T UNIT() { return 1; };
template<typename T> using Matrix = Matrix_<T, PLUS<T>, MULT<T>, ZERO<T>, UNIT<T>>;
// ----
const double TAU = atan2(0, -1) * 2.0;
int main() {
using M = Matrix<LD>;
int IN(n);
SegmentTree<M> st(n, OP(A * B), M::unit(3));
inc(i, n) {
LD IN(p, q, r);
LD c = cos(r * TAU / 360);
LD s = sin(r * TAU / 360);
st.ref(i) =
M ({
{ 1, 0, 0 },
{ 0, 1, 0 },
{ -p, -q, 1 },
}) *
M({
{ c, +s, 0 },
{ -s, c, 0 },
{ 0, 0, 1 },
}) *
M ({
{ 1, 0, 0 },
{ 0, 1, 0 },
{ +p, +q, 1 },
})
;
}
st.calc();
int IN(q);
inc(qq, q) {
int IN(s, t);
LD IN(x, y);
s--; t--;
auto a = M({ { x, y, 1 } }) * st.fold_II(s, t);
out(a[0][0], a[0][1]);
}
}