結果
| 問題 | No.1226 I hate Robot Arms |
| ユーザー |
 yuto1115
|
| 提出日時 | 2020-09-11 23:59:53 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,205 bytes |
| コンパイル時間 | 2,685 ms |
| コンパイル使用メモリ | 227,108 KB |
| 実行使用メモリ | 58,096 KB |
| 最終ジャッジ日時 | 2024-06-10 11:05:06 |
| 合計ジャッジ時間 | 16,431 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | TLE | - |
| testcase_04 | TLE | - |
| testcase_05 | TLE | - |
| testcase_06 | TLE | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
ソースコード
//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on
template<typename T>
struct matrix {
int h, w;
vector<vector<T>> v;
constexpr matrix(int h, int w, T t) : h(h), w(w), v(vector<vector<T>>(h, vector<T>(w, t))) {}
constexpr matrix(const vector<vector<T>> &v) : v(v), h(v.size()), w(v[0].size()) {}
matrix &operator+=(const matrix &a) {
rep(i, h) rep(j, w) v[i][j] += a.v[i][j];
return *this;
}
matrix &operator*=(const int &k) {
rep(i, h) rep(j, w) v[i][j] *= k;
return *this;
}
matrix &operator-=(const matrix &a) {
*this += a * (-1);
return *this;
}
matrix operator+(const matrix &a) const {
auto res(*this);
return res += a;
}
matrix operator*(const int &k) const { return res(*this) *= k; }
matrix operator-(const matrix &a) const { return res(*this) -= a; }
matrix operator*(const matrix &a) const {
assert(w == a.h);
matrix res(h, a.w, 0);
rep(i, h) rep(j, a.h) rep(k, a.w) res.v[i][k] += v[i][j] * a.v[j][k];
return res;
}
matrix &operator*=(const matrix &a) { return *this = *this * a; }
matrix pow(ll t) const {
matrix res(h, w, 0), a(*this);
rep(i, h) res.v[i][i] = 1;
while (t > 0) {
if (t & 1) res *= a;
t >>= 1;
a *= a;
}
return res;
}
};
template<class Node>
class lazy_segtree {
using V = typename Node::value_structure;
using VT = typename V::value_type;
using O = typename Node::operate_structure;
using OT = typename O::value_type;
int n;
vector<Node> tree;
void propagate(int k, int l, int r) {
// if (tree[k].op.value == O::identity) return;
if (k < n) {
tree[k * 2].op.value = O::operate(tree[k * 2].op.value, tree[k].op.value);
tree[k * 2 + 1].op = O::operate(tree[k * 2 + 1].op.value, tree[k].op.value);
}
OT ot = O::duplicate(tree[k].op.value, r - l);
tree[k].value.value = Node::operate(tree[k].value.value, ot);
tree[k].op.value = O::identity;
}
public:
VT get(int i) { return Node::operate(tree[i].value.value, tree[i].op.value); }
lazy_segtree(int _n, vector<VT> init = vector<VT>()) {
n = 1;
while (n < _n) n *= 2;
tree.assign(n * 2, Node{V::identity, O::identity});
if (init.size()) rep(i, _n) tree[i + n].value.value = init[i];
rrep(i, n) tree[i].value.value = V::operate(tree[i * 2].value.value, tree[i * 2 + 1].value.value);
}
void update(int a, int b, OT x, int k = 1, int l = 0, int r = -1) {
if (r == -1) r = n;
propagate(k, l, r);
if (a <= l && r <= b) {
tree[k].op.value = O::operate(tree[k].op.value, x);
propagate(k, l, r);
} else if (a < r && l < b) {
update(a, b, x, k * 2, l, (l + r) / 2);
update(a, b, x, k * 2 + 1, (l + r) / 2, r);
tree[k].value.value = V::operate(tree[k * 2].value.value, tree[k * 2 + 1].value.value);
}
}
// segment [a,b)
VT fold(int a, int b, int k = 1, int l = 0, int r = -1) {
if (r == -1) r = n;
propagate(k, l, r);
if (b <= l || r <= a) return V::identity;
if (a <= l && r <= b) return tree[k].value.value;
VT lt = fold(a, b, k * 2, l, (l + r) / 2);
VT rt = fold(a, b, k * 2 + 1, (l + r) / 2, r);
return V::operate(lt, rt);
}
};
using mat = matrix<double>;
const mat mat_id = matrix<double>(vvd({{1, 0},
{0, 1}}));
class Value_structure {
public:
using value_type = pair<double, double>;
value_type value;
Value_structure(value_type value) : value(value) {}
static constexpr value_type identity = make_pair(0.0, 0.0);
static constexpr value_type operate(const value_type &l, const value_type &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
};
class Operate_structure {
public:
using value_type = mat;
value_type value;
Operate_structure(value_type value) : value(value) {}
static const value_type identity;
static const value_type operate(const value_type &l, const value_type &r) {
return r * l;
}
static const value_type duplicate(const value_type &v, int len) {
return v;
}
};
const mat Operate_structure::identity = mat_id;
class Node {
public:
using value_structure = Value_structure;
using operate_structure = Operate_structure;
value_structure value;
operate_structure op;
private:
using V = value_structure::value_type;
using O = operate_structure::value_type;
public:
Node(V value, O op) : value(value), op(op) {}
static const V operate(const V &l, const O &r) {
auto v = vvd(2, vd(1));
v[0][0] = l.first, v[1][0] = l.second;
auto vm = mat(v);
auto res = r * vm;
return make_pair(res.v[0][0], res.v[1][0]);
}
};
const double PI = acos(-1);
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, q;
cin >> n >> q;
vector<pair<double, double>> init(n);
rep(i, n) init[i] = {1, 0};
lazy_segtree<Node> st(n, init);
cout << fixed << setprecision(10);
auto rot = [&](int l, int r, double theta) {
vvd v(2, vd(2));
v[0][0] = cos(theta);
v[0][1] = -sin(theta);
v[1][0] = sin(theta);
v[1][1] = cos(theta);
st.update(l, r, mat(v));
};
auto scalar_multiple = [&](int l, int r, double k) {
vvd v(2, vd(2));
v[0][0] = k;
v[1][1] = k;
st.update(l, r, mat(v));
};
while (q--) {
int t, i;
cin >> t >> i;
i--;
if (t == 0) {
int x;
cin >> x;
double a, b;
auto[dx, dy] = st.fold(0, i + 1);
a = atan2(dy, dx);
b = 0;
if (i > 0) {
auto[dx, dy] = st.fold(0, i);
b = atan2(dy, dx);
}
double ori = a - b;
rot(i, n, (double) x / 180.0 * PI - ori);
} else if (t == 1) {
int x;
cin >> x;
auto[dx, dy] = st.fold(i, i + 1);
double d = sqrt(dx * dx + dy * dy);
scalar_multiple(i, i + 1, (double) x / d);
} else {
auto[x, y] = st.fold(0, i + 1);
cout << x << ' ' << y << '\n';
}
}
}