結果
問題 | No.1226 I hate Robot Arms |
ユーザー |
![]() |
提出日時 | 2020-09-11 22:50:27 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,441 bytes |
コンパイル時間 | 2,322 ms |
コンパイル使用メモリ | 199,424 KB |
最終ジャッジ日時 | 2025-01-14 11:13:36 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 1 |
other | WA * 28 |
ソースコード
#include <algorithm>#ifdef _MSC_VER#include <intrin.h>#endifnamespace atcoder {namespace internal {// @param n `0 <= n`// @return minimum non-negative `x` s.t. `n <= 2**x`int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}// @param n `1 <= n`// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`int bsf(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}} // namespace internal} // namespace atcoder#include <cassert>#include <vector>namespace atcoder {template <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}segtree(int n) : segtree(std::vector<S>(n, e())) {}segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }template <bool (*f)(S)> int max_right(int l) {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0 <= l && l <= _n);assert(f(e()));if (l == _n) return _n;l += size;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, d[l]))) {while (l < size) {l = (2 * l);if (f(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*f)(S)> int min_left(int r) {return min_left(r, [](S x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(d[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};} // namespace atcoder#include <bits/stdc++.h>#define rep(a,n) for (ll a = 0; a < (n); ++a)using namespace std;using namespace atcoder;using ll = long long;typedef pair<ll,ll> P;typedef pair<ll,P> PP;typedef vector<vector<int> > Graph;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }const ll INF = 1e18;double op(double a,double b){return a+b;}double op_mod(double a,double b){double res = a+b;//if(res>360.0)res -= 360.0;return res;}double e(){return 0.0;}const double PI = 3.14159265358979;double toRad(double degree){return degree*PI/180.0;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);//inputll n,q;cin >> n >> q;segtree<double,op,e> seg_x(n),seg_y(n);segtree<double,op_mod,e> kaku(n);vector<double>len(n,1);rep(i,n){double x = len[i]*cos(toRad(kaku.prod(0,i)));double y = len[i]*sin(toRad(kaku.prod(0,i)));seg_x.set(i,x);seg_y.set(i,y);}rep(i,q){int t;cin >> t;if(t==0){int k;double x;cin >> k >> x;kaku.set(k-1,x);double now_x = len[k-1]*cos(toRad(kaku.prod(0,k)));double now_y = len[k-1]*sin(toRad(kaku.prod(0,k)));seg_x.set(k-1,now_x);seg_y.set(k-1,now_y);}if(t==1){int k;double x;cin >> k >> x;len[k-1]=x;double now_x = x*cos(toRad(kaku.prod(0,k)));double now_y = x*sin(toRad(kaku.prod(0,k)));seg_x.set(k-1,now_x);seg_y.set(k-1,now_y);}if(t==2){int k;cin >> k;double x,y;x = seg_x.prod(0,k);y = seg_y.prod(0,k);printf("%.10lf ",x);printf("%.10lf\n",y);}}return 0;}