結果
| 問題 | No.1226 I hate Robot Arms |
| ユーザー |
 hitonanode
|
| 提出日時 | 2020-09-12 00:08:38 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 262 ms / 2,000 ms |
| コード長 | 8,742 bytes |
| コンパイル時間 | 2,230 ms |
| コンパイル使用メモリ | 211,536 KB |
| 実行使用メモリ | 13,428 KB |
| 最終ジャッジ日時 | 2024-06-10 11:09:27 |
| 合計ジャッジ時間 | 13,478 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,816 KB |
| testcase_01 | AC | 2 ms
6,944 KB |
| testcase_02 | AC | 79 ms
6,944 KB |
| testcase_03 | AC | 80 ms
6,940 KB |
| testcase_04 | AC | 89 ms
10,880 KB |
| testcase_05 | AC | 78 ms
12,740 KB |
| testcase_06 | AC | 206 ms
12,228 KB |
| testcase_07 | AC | 66 ms
6,940 KB |
| testcase_08 | AC | 23 ms
11,136 KB |
| testcase_09 | AC | 147 ms
6,944 KB |
| testcase_10 | AC | 19 ms
6,940 KB |
| testcase_11 | AC | 97 ms
10,360 KB |
| testcase_12 | AC | 53 ms
7,040 KB |
| testcase_13 | AC | 42 ms
12,964 KB |
| testcase_14 | AC | 180 ms
6,944 KB |
| testcase_15 | AC | 16 ms
11,732 KB |
| testcase_16 | AC | 195 ms
12,928 KB |
| testcase_17 | AC | 57 ms
6,944 KB |
| testcase_18 | AC | 39 ms
6,944 KB |
| testcase_19 | AC | 104 ms
11,496 KB |
| testcase_20 | AC | 88 ms
10,716 KB |
| testcase_21 | AC | 126 ms
9,984 KB |
| testcase_22 | AC | 220 ms
13,208 KB |
| testcase_23 | AC | 208 ms
13,428 KB |
| testcase_24 | AC | 209 ms
13,232 KB |
| testcase_25 | AC | 217 ms
13,328 KB |
| testcase_26 | AC | 224 ms
13,228 KB |
| testcase_27 | AC | 258 ms
13,272 KB |
| testcase_28 | AC | 262 ms
13,208 KB |
| testcase_29 | AC | 259 ms
13,240 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif
// Nonrecursive Segment Tree (point-update, range-get)
// - Conditions for operations:
// - merge_data: [TDATA, TDATA] -> TDATA, e(x, y) == e(y, x)
// - data2ret: [TDATA, TQUERY] -> TRET
// - merge_ret: [TRET, TRET] -> TRET, g(defaultRET, x) == x, g(x, y) = g(y, x)
// - commutability f(e(x, y), q) == g(f(x, q), f(y, q))
template <typename TDATA, typename TRET, typename TQUERY>
struct NonrecursiveSegmentTree
{
int N;
TRET defaultRET;
virtual TDATA merge_data(const TDATA &, const TDATA &) = 0;
virtual TRET data2ret(const TDATA &, const TQUERY &) = 0;
virtual TRET merge_ret(const TRET &, const TRET &) = 0;
std::vector<TDATA> data;
inline TDATA& at(int i) { return data[i]; }
inline void _merge(int i) { at(i) = merge_data(at(i << 1), at((i << 1) + 1)); }
void initialize(const std::vector<TDATA> &seq, TRET RET_ZERO) {
N = seq.size();
defaultRET = RET_ZERO;
data = seq;
data.insert(data.end(), seq.begin(), seq.end());
for (int i = N - 1; i; i--) _merge(i);
}
NonrecursiveSegmentTree() = default;
void update(int pos, const TDATA &x) {
assert(pos >= 0 and pos < N);
at(pos + N) = x;
for (int i = pos + N; i > 1;) i >>= 1, _merge(i);
}
// [l, r), 0-indexed
TRET get(int l, int r, TQUERY query = NULL) {
assert(l >= 0 and r <= N);
TRET retl = defaultRET, retr = defaultRET;
l += N, r += N;
while (l < r) {
if (l & 1) retl = merge_ret(retl, data2ret(data[l++], query));
if (r & 1) retr = merge_ret(data2ret(data[--r], query), retr);
l >>= 1, r >>= 1;
}
return merge_ret(retl, retr);
}
// Calculate smallest r that satisfies g(f(x_l, q), ..., f(x_{r - 1}, q)) >= threshold
// Assumption: Monotonicity of g(x_l, ..., x_r) about r (l: fixed)
// Complexity: O(log N)
int binary_search(int l, const TRET &threshold, TQUERY query = NULL) {
std::stack<int> rs;
l += N;
int r = N * 2;
TRET retl = defaultRET;
if (threshold <= retl) return l - N;
while (l < r) {
if (l & 1) {
TRET ret_tmp = merge_ret(retl, data2ret(data[l], query));
if (threshold <= ret_tmp) {
while (l * 2 < N * 2) {
ret_tmp = merge_ret(retl, data2ret(data[l * 2], query));
if (threshold <= ret_tmp) l *= 2;
else retl = ret_tmp, l = l * 2 + 1;
}
return l - N;
}
l++;
retl = ret_tmp;
}
if (r & 1) rs.push(--r);
l >>= 1, r >>= 1;
}
while (!rs.empty()) {
l = rs.top();
rs.pop();
TRET ret_tmp = merge_ret(retl, data2ret(data[l], query));
if (threshold <= ret_tmp) {
while (l * 2 < N * 2) {
ret_tmp = merge_ret(retl, data2ret(data[l * 2], query));
if (threshold <= ret_tmp) l *= 2;
else retl = ret_tmp, l = l * 2 + 1;
}
return l - N;
}
retl = ret_tmp;
}
return N;
}
};
struct T
{
int deg_out;
double dx, dy;
};
const long double PI = acosl(-1.0l);
struct SegmentTree : public NonrecursiveSegmentTree<T, T, bool>
{
using SegTree = NonrecursiveSegmentTree<T, T, bool>;
T merge_data(const T &vl, const T &vr) override {
double rad = vl.deg_out / 360.0 * PI * 2;
double dx = vl.dx + cos(rad) * vr.dx - sin(rad) * vr.dy;
double dy = vl.dy + sin(rad) * vr.dx + cos(rad) * vr.dy;
return T{(vl.deg_out + vr.deg_out + 720) % 360, dx, dy};
};
T data2ret(const T &v, const bool &q) override { return v; }
T merge_ret(const T &vl, const T &vr) override { return merge_data(vl, vr); };
SegmentTree(const std::vector<T> &seq, T defaultmin) : SegTree::NonrecursiveSegmentTree()
{
SegTree::initialize(seq, defaultmin);
};
};
int main()
{
int N, Q;
cin >> N >> Q;
vector<T> vec(N + 1);
vector<int> deg_now(N + 1, 0);
vector<int> len_now(N + 1, 1);
len_now[0] = 0;
FOR(i, 1, N + 1) vec[i].dx = 1;
SegmentTree tree(vec, vec[0]);
while (Q--)
{
int q, i, x;
cin >> q >> i;
if (q == 0)
{
cin >> x;
i--;
deg_now[i] = x;
vec[i].deg_out = deg_now[i];
tree.update(i, vec[i]);
}
if (q == 1)
{
cin >> x;
vec[i].dx /= len_now[i];
vec[i].dy /= len_now[i];
len_now[i] = x;
vec[i].dx *= len_now[i];
vec[i].dy *= len_now[i];
tree.update(i, vec[i]);
}
if (q == 2)
{
auto ret = tree.get(0, i + 1);
cout << ret.dx << ' ' << ret.dy << '\n';
}
}
}