結果

問題 No.1226 I hate Robot Arms
ユーザー FF256grhyFF256grhy
提出日時 2020-09-11 23:36:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 434 ms / 2,000 ms
コード長 6,480 bytes
コンパイル時間 2,337 ms
コンパイル使用メモリ 209,460 KB
実行使用メモリ 9,392 KB
最終ジャッジ日時 2023-08-30 10:37:22
合計ジャッジ時間 15,954 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 130 ms
4,376 KB
testcase_03 AC 150 ms
4,548 KB
testcase_04 AC 160 ms
9,192 KB
testcase_05 AC 142 ms
9,388 KB
testcase_06 AC 378 ms
9,196 KB
testcase_07 AC 117 ms
4,380 KB
testcase_08 AC 38 ms
9,160 KB
testcase_09 AC 274 ms
4,644 KB
testcase_10 AC 32 ms
4,376 KB
testcase_11 AC 182 ms
9,264 KB
testcase_12 AC 100 ms
6,160 KB
testcase_13 AC 71 ms
9,192 KB
testcase_14 AC 337 ms
4,624 KB
testcase_15 AC 24 ms
9,248 KB
testcase_16 AC 374 ms
9,204 KB
testcase_17 AC 104 ms
4,572 KB
testcase_18 AC 67 ms
4,648 KB
testcase_19 AC 187 ms
9,188 KB
testcase_20 AC 169 ms
9,392 KB
testcase_21 AC 238 ms
9,248 KB
testcase_22 AC 389 ms
9,168 KB
testcase_23 AC 387 ms
9,244 KB
testcase_24 AC 393 ms
9,244 KB
testcase_25 AC 391 ms
9,312 KB
testcase_26 AC 385 ms
9,160 KB
testcase_27 AC 428 ms
9,212 KB
testcase_28 AC 432 ms
9,388 KB
testcase_29 AC 434 ms
9,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(LL 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 x, auto l, auto r) { return (l <= x && x <= r); };
auto inIX = [](auto x, auto l, auto r) { return (l <= x && x <  r); };
auto inXI = [](auto x, auto l, auto r) { return (l <  x && x <= r); };
auto inXX = [](auto x, auto l, auto r) { return (l <  x && x <  r); };
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#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(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define RV(c) reverse(ALL(c))
#define SC static_cast
#define SI(c) SC<int>(c.size())
#define SL(c) SC<LL >(c.size())
#define RF(e, c) for(auto & e: c)
#define SF(c, ...) for(auto & [__VA_ARGS__]: c)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
array<string, 3> SEQ = { "", " ", "" };
// input elements (as a tuple)
template<typename U, int I> void in_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void in_(U & t) { (* IS) >> get<I>(t); in_<U, I + 1, B ...>(t); }
template<typename ... T> auto in() { tuple<T ...> t; in_<tuple<T ...>, 0, T ...>(t); return t; }
// input an array
template<typename T, int N> auto ain() { array<T, N> a; inc(i, N) { (* IS) >> a[i]; } return a; }
// input a (multi-dimensional) vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input multi-column (as a tuple of vector)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	A a; (* IS) >> a; get<I>(t).push_back(a); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
// output elements
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
// output a (multi-dimensional) vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout(T && v, A a, B ... b) {
	vout_(v, b ...); (* OS) << a << flush;
}

// ---- ----

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

// ----

const double TAU = atan2(0, -1) * 2.0;

int main() {
	auto f = [](auto a, auto b) -> array<double, 3> {
		auto [t0, d, t1] = a;
		auto [T0, D, T1] = b;
		auto x = d * cos(t0) + D * cos(t1 + T0);
		auto y = d * sin(t0) + D * sin(t1 + T0);
		auto L = sqrt(x*x + y*y);
		return { atan2(y, x), L, t1 + T1 };
	};
	
	auto [n, Q] = in<int, int>();
	SegmentTree<array<double, 3>> st(n, f, { 0, 0, 0 });
	inc(i, n) { st.ref(i)[1] = 1; }
	st.calc();
	cout.precision(10);
	inc(q, Q) {
		auto [type, i] = in<int, int>();
		int x; if(type != 2) { cin >> x; i--; }
		
		if(type == 0) { st.apply(i, AP(A[0] = A[2] = TAU * x / 360.0)); }
		if(type == 1) { st.apply(i, AP(A[1] = x)); }
		if(type == 2) {
			auto [t, d, t_] = st.fold_IX(0, i);
			auto x = d * cos(t);
			auto y = d * sin(t);
			//outS(t, d, t_, ":");
			out(x, y);
			/*
			printf("%.9f ", t);
			printf("%.9f ", d);
			printf("%.9f:      ", t_);
			printf("%.9f ", x);
			printf("%.9f\n", y);
			*/
		}
	}
}
0