結果
問題 | No.1226 I hate Robot Arms |
ユーザー | tokusakurai |
提出日時 | 2020-09-11 22:59:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 373 ms / 2,000 ms |
コード長 | 4,124 bytes |
コンパイル時間 | 2,360 ms |
コンパイル使用メモリ | 208,824 KB |
実行使用メモリ | 13,192 KB |
最終ジャッジ日時 | 2023-08-30 10:17:56 |
合計ジャッジ時間 | 15,191 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 99 ms
4,488 KB |
testcase_03 | AC | 119 ms
5,508 KB |
testcase_04 | AC | 130 ms
12,468 KB |
testcase_05 | AC | 119 ms
12,684 KB |
testcase_06 | AC | 312 ms
12,680 KB |
testcase_07 | AC | 93 ms
4,376 KB |
testcase_08 | AC | 32 ms
12,512 KB |
testcase_09 | AC | 214 ms
5,616 KB |
testcase_10 | AC | 25 ms
4,376 KB |
testcase_11 | AC | 152 ms
12,348 KB |
testcase_12 | AC | 81 ms
7,752 KB |
testcase_13 | AC | 60 ms
12,680 KB |
testcase_14 | AC | 266 ms
5,284 KB |
testcase_15 | AC | 21 ms
12,776 KB |
testcase_16 | AC | 310 ms
12,588 KB |
testcase_17 | AC | 82 ms
5,776 KB |
testcase_18 | AC | 55 ms
5,756 KB |
testcase_19 | AC | 154 ms
12,412 KB |
testcase_20 | AC | 139 ms
12,400 KB |
testcase_21 | AC | 192 ms
12,560 KB |
testcase_22 | AC | 311 ms
13,156 KB |
testcase_23 | AC | 323 ms
13,164 KB |
testcase_24 | AC | 317 ms
13,084 KB |
testcase_25 | AC | 313 ms
13,128 KB |
testcase_26 | AC | 309 ms
13,116 KB |
testcase_27 | AC | 373 ms
13,192 KB |
testcase_28 | AC | 368 ms
13,152 KB |
testcase_29 | AC | 372 ms
13,096 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp(x) fixed << setprecision(x) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const ll MOD = 1000000007; //const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const double pi = acos(-1.0); const double EPS = 1e-10; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; template<typename Monoid, typename Operator_Monoid> struct Lazy_Segment_Tree{ vector<Monoid> seg; vector<Operator_Monoid> lazy; const Monoid e1; const Operator_Monoid e2; const int n; Monoid f(const Monoid &a, const Monoid &b) const {return a+b;} Monoid g(const Monoid &a, const Operator_Monoid &b) const {return a*b;} Operator_Monoid h(const Operator_Monoid &a, const Operator_Monoid &b) const {return a*b;} Lazy_Segment_Tree(int N, const Monoid &e1, const Operator_Monoid &e2) : e1(e1), e2(e2), n(1<<(32-__builtin_clz(N-1))){ seg.assign(2*n, e1), lazy.assign(2*n, e2); } void set(int i, const Monoid &x) {seg[n+i] = x;} void build(){ rep3(i, n-1, 1) seg[i] = f(seg[2*i], seg[2*i+1]); } void init(int N, const Monoid &x){ rep(i, N) set(i, x); build(); } void eval(int i, int l, int r){ if(lazy[i] != e2){ //seg[i] = g(seg[i], lazy[i]*(r-l)); seg[i] = g(seg[i], lazy[i]); if(r-l > 1){ lazy[2*i] = h(lazy[2*i] ,lazy[i]); lazy[2*i+1] = h(lazy[2*i+1], lazy[i]); } lazy[i] = e2; } } void add(int a, int b, const Operator_Monoid &x, int i, int l, int r){ eval(i, l, r); if(a >= r || b <= l) return; if(a <= l && r <= b){ lazy[i] = h(lazy[i], x); eval(i, l, r); } else{ add(a, b, x, 2*i, l, (l+r)/2); add(a, b, x, 2*i+1, (l+r)/2, r); seg[i] = f(seg[2*i], seg[2*i+1]); } } void add(int a, int b, const Operator_Monoid &x) {add(a, b, x, 1, 0, n);} Monoid query(int a, int b, int i, int l, int r){ eval(i, l, r); if(a >= r || b <= l) return e1; if(a <= l && r <= b) return seg[i]; Monoid vl = query(a, b, 2*i, l, (l+r)/2); Monoid vr = query(a, b, 2*i+1, (l+r)/2, r); return f(vl, vr); } Monoid query(int a, int b) {return query(a, b, 1, 0, n);} void update(int i, int l, int r){ seg[i] = g(seg[i], lazy[i]); if(r-l > 1){ lazy[2*i] = h(lazy[2*i], lazy[i]); lazy[2*i+1] = h(lazy[2*i+1], lazy[i]); update(2*i, l, (l+r)/2); update(2*i+1, (l+r)/2, r); } lazy[i] = e2; } void update() {update(1, 0, n);} Monoid operator [] (int i) const {return seg[n+i];} void clear(){ fill(all(seg), e1), fill(all(lazy), e2); } }; int main(){ int N, Q; cin >> N >> Q; Lazy_Segment_Tree<complex<double>, complex<double>> seg(N, {0.0, 0.0}, {1.0, 0.0}); seg.init(N, {1.0, 0.0}); double t[N], d[N]; fill(t, t+N, 0.0), fill(d, d+N, 1.0); while(Q--){ int q, i; cin >> q >> i; if(q == 2){ complex<double> ans = seg.query(0, i); cout << sp(10) << real(ans) << ' ' << imag(ans) << endl; } else{ double x; cin >> x; if(q == 0){ seg.add(i-1, N, polar(1.0, (x-t[i-1])*pi/180.0)); t[i-1] = x; } else{ seg.add(i-1, i, {x/d[i-1], 0.0}); d[i-1] = x; } } } }