結果
| 問題 | No.1226 I hate Robot Arms |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-09-11 22:23:45 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 592 ms / 2,000 ms |
| コード長 | 11,364 bytes |
| コンパイル時間 | 1,601 ms |
| コンパイル使用メモリ | 182,044 KB |
| 実行使用メモリ | 101,916 KB |
| 最終ジャッジ日時 | 2024-06-10 10:23:18 |
| 合計ジャッジ時間 | 17,228 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 29 ms
101,888 KB |
| testcase_01 | AC | 30 ms
101,916 KB |
| testcase_02 | AC | 201 ms
101,504 KB |
| testcase_03 | AC | 226 ms
101,800 KB |
| testcase_04 | AC | 285 ms
101,760 KB |
| testcase_05 | AC | 274 ms
101,816 KB |
| testcase_06 | AC | 524 ms
101,748 KB |
| testcase_07 | AC | 190 ms
101,632 KB |
| testcase_08 | AC | 142 ms
101,808 KB |
| testcase_09 | AC | 354 ms
101,692 KB |
| testcase_10 | AC | 75 ms
101,744 KB |
| testcase_11 | AC | 285 ms
101,700 KB |
| testcase_12 | AC | 183 ms
101,768 KB |
| testcase_13 | AC | 199 ms
101,636 KB |
| testcase_14 | AC | 434 ms
101,800 KB |
| testcase_15 | AC | 131 ms
101,756 KB |
| testcase_16 | AC | 503 ms
101,800 KB |
| testcase_17 | AC | 183 ms
101,864 KB |
| testcase_18 | AC | 141 ms
101,812 KB |
| testcase_19 | AC | 310 ms
101,804 KB |
| testcase_20 | AC | 288 ms
101,748 KB |
| testcase_21 | AC | 330 ms
101,692 KB |
| testcase_22 | AC | 523 ms
101,752 KB |
| testcase_23 | AC | 500 ms
101,800 KB |
| testcase_24 | AC | 524 ms
101,628 KB |
| testcase_25 | AC | 512 ms
101,864 KB |
| testcase_26 | AC | 534 ms
101,636 KB |
| testcase_27 | AC | 558 ms
101,812 KB |
| testcase_28 | AC | 592 ms
101,508 KB |
| testcase_29 | AC | 545 ms
101,688 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// #pragma GCC target("arch=skylake-avx512")
// export CPLUS_INCLUDE_PATH="/Users/shuzaei/Desktop/ac-library"
// /usr/bin/env python3 "/Users/shuzaei/Desktop/ac-library/expander.py"
// /Users/shuzaei/Desktop/Solve.cpp
// #include <atcoder/all>
// using namespace atcoder;
#pragma region template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb(b);
if (__DIRECTED__ == false) g[b].pb(a);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
if (__ZERO_INDEXED__ == false) a--, b--;
g[a].pb({b, c});
if (__DIRECTED__ == false) g[b].pb({a, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dumpi(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
if (__i) cerr << ",\n"; \
cerr << "["; \
rep(__j, w) { \
if (__j) cerr << ", "; \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞"; \
else \
cerr << a[__i][__j]; \
} \
cerr << "]" << rt; \
} \
cerr << "\n]" << rt; \
}
#define vdumpi(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << ", "; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞"; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
if (__i) cerr << ",\n"; \
cerr << "["; \
rep(__j, w) { \
if (__j) cerr << ", "; \
cerr << a[__i][__j]; \
} \
cerr << "]"; \
} \
cerr << "\n]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << ", "; \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
template <class S, class T> istream &operator>>(istream &is, pair<S, T> &p) {
is >> p.first >> p.second;
return is;
}
template <class S, class T> ostream &operator<<(ostream &os, const pair<S, T> &p) {
os << p.first << ' ' << p.second;
return os;
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
#pragma endregion
struct point {
ld dx, dy;
ll ang;
point(ld x = 0, ld y = 0, ll a = 0) : dx(x), dy(y), ang(a) {}
};
struct UshiTree {
using Type = point;
Type unit = point();
function<Type(Type, Type)> comb = [](Type left, Type right) {
point merge(left.dx + cosl(left.ang / 180.0L * M_PI) * right.dx -
sinl(left.ang / 180.0L * M_PI) * right.dy,
left.dy + sinl(left.ang / 180.0L * M_PI) * right.dx +
cosl(left.ang / 180.0L * M_PI) * right.dy,
(left.ang + right.ang) % 360);
return merge;
};
static const ll n = 1 << 20;
vector<Type> node;
UshiTree() : node(2 * n - 1, unit) {}
inline void update(ll a, Type x) {
ll i = n - 1 + a;
node[i] = x;
while (i != 0) {
i = (i - 1) / 2;
node[i] = comb(node[i * 2 + 1], node[i * 2 + 2]);
}
}
inline Type result(ll a, ll b, ll i = 0, ll l = 0, ll r = n) {
if (b <= l or r <= a) return unit;
if (a <= l and r <= b) {
return node[i];
} else {
return comb(result(a, b, i * 2 + 1, l, (l + r) / 2),
result(a, b, i * 2 + 2, (l + r) / 2, r));
}
}
} seg;
signed main() {
ll N, Q;
cin >> N >> Q;
rep(i, N) seg.update(i, point(1, 0, 0));
rep(i, Q) {
ll A, B, C;
cin >> A;
if (A == 1) {
cin >> B >> C;
auto prev = seg.result(B - 1, B);
ld len = sqrtl(prev.dx * prev.dx + prev.dy * prev.dy);
seg.update(B - 1, point(prev.dx / len * C, prev.dy / len * C, prev.ang));
}
if (A == 0) {
cin >> B >> C;
auto prev = seg.result(B - 1, B);
ld len = sqrtl(prev.dx * prev.dx + prev.dy * prev.dy);
prev.ang = C;
seg.update(B - 1, point(len * cosl(prev.ang / 180.0L * M_PI),
len * sinl(prev.ang / 180.0L * M_PI), prev.ang));
}
if (A == 2) {
cin >> B;
fout(10) << seg.result(0, B).dx << sp << seg.result(0, B).dy << rt;
}
}
}