結果

問題 No.675 ドットちゃんたち
ユーザー satanicsatanic
提出日時 2018-04-13 23:26:54
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,867 ms / 2,000 ms
コード長 7,637 bytes
コンパイル時間 1,919 ms
コンパイル使用メモリ 145,344 KB
実行使用メモリ 54,520 KB
最終ジャッジ日時 2024-06-26 21:55:54
合計ジャッジ時間 14,698 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i,
    __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest
    ...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p,
    rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
// output
#define OUT(d) std::cout<<(d);
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<(d);
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<(d);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << (d) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res =
    std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n";
    }
// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-9;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------
// --------8<-------- --------8<--------
struct Node {
std::vector<std::vector<int>> a;
Node(std::vector<std::vector<int>> a) : a(a) {}
static Node merge(const Node& l, const Node& r);
};
Node Node::merge(const Node& l, const Node& r) {
std::vector<std::vector<int>> a(3, std::vector<int>(3, 0));
REP(i, 3) REP(j, 3) REP(k, 3) {
a[i][j] += r.a[i][k] * l.a[k][j];
}
return Node(a);
};
// -------->8-------------------------------->8--------
//SegmentTreeEx(Node)
class SegmentTreeEx {
public:
int size;
Node init_val;
std::vector<Node> ary;
SegmentTreeEx(int n, Node init_val) : size(1), init_val(init_val) {
while (size < n) size *= 2;
size = size * 2 - 1;
ary.resize(size, init_val);
}
void init(int i, int l, int r) {
if (r - l == 1) {
//
}
else {
//
init(i * 2 + 1, l, (l + r) / 2);
init(i * 2 + 2, (l + r) / 2, r);
ary[i] = Node::merge(ary[i * 2 + 1], ary[i * 2 + 2]);
}
}
void update(int i, Node node) {
i += size / 2;
//
// ( : ary[i] += v;)
ary[i] = node;
//
while (i > 0) {
i = (i - 1) / 2;
ary[i] = Node::merge(ary[i * 2 + 1], ary[i * 2 + 2]);
}
}
// [a, b) (query_(a, b, 0, 0, n))
Node query_(int a, int b, int i, int l, int r) const {
if (r <= a || b <= l) return init_val;
if (a <= l && r <= b) return ary[i];
else {
Node ln = query_(a, b, 2 * i + 1, l, (l + r) / 2);
Node rn = query_(a, b, 2 * i + 2, (l + r) / 2, r);
return Node::merge(ln, rn);
}
}
// [a, b)
Node query(int a, int b) const {
return query_(a, b, 0, 0, size / 2 + 1);
}
};
signed main() {
INIT;
VAR(int, n, px, py);
std::vector<std::vector<int>> c(3, std::vector<int>(3, 0));
auto e = c;
e[0][0] = e[1][1] = e[2][2] = 1;
SegmentTreeEx st(n, e);
REP(i, n) {
VAR(int, C);
if (C == 1) {
VAR(int, d);
auto t(e);
t[0][2] = d;
st.ary[st.size / 2 + i] = Node(t);
}
else if (C == 2) {
VAR(int, d);
auto t(e);
t[1][2] = d;
st.ary[st.size / 2 + i] = Node(t);
}
else {
auto t(c);
t[0][1] = 1;
t[1][0] = -1;
t[2][2] = 1;
st.ary[st.size / 2 + i] = Node(t);
}
}
st.init(0, 0, st.size / 2 + 1);
REP(i, n) {
auto t = st.query(i, n);
auto a(t.a);
int x = a[0][0] * px + a[0][1] * py + a[0][2];
int y = a[1][0] * px + a[1][1] * py + a[1][2];
OUT(x)SP OUT(y)BR;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0