結果

問題 No.1226 I hate Robot Arms
ユーザー packer_jppacker_jp
提出日時 2020-09-11 22:47:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 502 ms / 2,000 ms
コード長 4,057 bytes
コンパイル時間 6,469 ms
コンパイル使用メモリ 206,828 KB
実行使用メモリ 12,220 KB
最終ジャッジ日時 2023-08-30 10:11:23
合計ジャッジ時間 20,556 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 147 ms
4,380 KB
testcase_03 AC 166 ms
5,068 KB
testcase_04 AC 181 ms
11,416 KB
testcase_05 AC 159 ms
11,472 KB
testcase_06 AC 423 ms
11,292 KB
testcase_07 AC 132 ms
4,380 KB
testcase_08 AC 43 ms
11,328 KB
testcase_09 AC 310 ms
5,264 KB
testcase_10 AC 36 ms
4,380 KB
testcase_11 AC 206 ms
10,884 KB
testcase_12 AC 111 ms
7,116 KB
testcase_13 AC 82 ms
11,300 KB
testcase_14 AC 377 ms
5,144 KB
testcase_15 AC 27 ms
11,852 KB
testcase_16 AC 414 ms
12,220 KB
testcase_17 AC 116 ms
5,592 KB
testcase_18 AC 75 ms
5,412 KB
testcase_19 AC 209 ms
11,064 KB
testcase_20 AC 191 ms
10,884 KB
testcase_21 AC 265 ms
10,824 KB
testcase_22 AC 435 ms
11,540 KB
testcase_23 AC 436 ms
11,608 KB
testcase_24 AC 433 ms
11,732 KB
testcase_25 AC 432 ms
11,720 KB
testcase_26 AC 431 ms
11,668 KB
testcase_27 AC 490 ms
11,556 KB
testcase_28 AC 502 ms
11,536 KB
testcase_29 AC 490 ms
11,668 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/segtree>
using namespace atcoder;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int x) { return (x > 0) - (x < 0); }
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T> T sq(T x) { return x * x; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

using S = tuple<double, double, double>;
S e() { return {0, 0, 0}; }
S op(S a, S b) {
    auto[ra, ta, fa]=a;
    auto[rb, tb, fb]=b;
    tb += fa, fb += fa;
    return {sqrt(sq(ra * cos(ta) + rb * cos(tb)) + sq(ra * sin(ta) + rb * sin(tb))),
            atan2(ra * sin(ta) + rb * sin(tb), ra * cos(ta) + rb * cos(tb)), fb};
}
signed main() {
    int N, Q;
    cin >> N >> Q;
    vector<S> src(N, {1, 0, 0});
    segtree<S, op, e> st(src);
    while (Q--) {
        int q;
        cin >> q;
        if (q == 0) {
            int i, x;
            cin >> i >> x, i--;
            auto[r, t, f]=st.get(i);
            t = x * PI / 180, f = x * PI / 180;
            st.set(i, {r, t, f});
        } else if (q == 1) {
            int i, x;
            cin >> i >> x, i--;
            auto[r, t, f]=st.get(i);
            r = x;
            st.set(i, {r, t, f});
        } else if (q == 2) {
            int i;
            cin >> i;
            auto[r, t, f]=st.prod(0, i);
            cout << r * cos(t) << " " << r * sin(t) << endl;
        }
    }
}
0