結果
| 問題 | No.619 CardShuffle |
| ユーザー |
 satanic
|
| 提出日時 | 2017-12-19 02:21:56 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 117 ms / 3,000 ms |
| コード長 | 8,078 bytes |
| コンパイル時間 | 1,500 ms |
| コンパイル使用メモリ | 127,756 KB |
| 実行使用メモリ | 7,552 KB |
| 最終ジャッジ日時 | 2024-12-22 21:41:42 |
| 合計ジャッジ時間 | 5,404 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 35 |
ソースコード
// need#include <iostream>#include <algorithm>// data structure#include <bitset>#include <map>#include <queue>#include <set>#include <stack>#include <string>#include <utility>#include <vector>//#include <array>//#include <unordered_map>//#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";}// testtemplate<class T> std::vector<std::vector<T>> VV(int n) {return std::vector<std::vector<T>>(n);}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 llusing 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^ 9constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9constexpr ll INFLL = 1LL << 60; // 1.15x10^18constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18constexpr double EPS = 1e-9;constexpr int MOD = 1000000007;constexpr double PI = 3.141592653589793238462643383279;// --------8<-------- ここを書き換える --------8<--------struct Node { // ([l] + [c] + [r] [+/*])int l, c, r;bool isOne;char op;Node(char v = '0', char op = '+') :l(v - '0'), c(0), r(v - '0'), isOne(true), op(op) {}Node(int l, int c, int r, bool isOne, char op) : l(l), c(c), r(r), isOne(isOne), op(op) {}static Node merge(const Node& l, const Node& r);int getValue() {if (isOne) return l;return (l + c + r) % MOD;}};Node Node::merge(const Node& l, const Node& r) {Node res;/* */if (l.isOne && l.op == '+' && r.isOne) {res = Node(l.r, 0, r.r, false, r.op);}else if (l.isOne && l.op == '+' && !r.isOne) {res = Node(l.r, (r.l + r.c) % MOD, r.r, false, r.op);}else if (l.isOne && l.op == '*' && r.isOne) {int t = l.l * r.l % MOD;res = Node(t, 0, t, true, r.op);}else if (l.isOne && l.op == '*' && !r.isOne) {res = Node(l.l * r.l % MOD, r.c, r.r, false, r.op);}else if (!l.isOne && l.op == '+' && r.isOne) {res = Node(l.l, (l.c + l.r) % MOD, r.r, false, r.op);}else if (!l.isOne && l.op == '+' && !r.isOne) {res = Node(l.l, (l.c + l.r + r.l + r.c) % MOD, r.r, false, r.op);}else if (!l.isOne && l.op == '*' && r.isOne) {res = Node(l.l, l.c, l.r * r.l % MOD, false, r.op);}else if (!l.isOne && l.op == '*' && !r.isOne) {res = Node(l.l, (l.c + l.r * r.l + r.c) % MOD, r.r, false, r.op);}return res;};// -------->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);init(0, 0, size / 2 + 1);}void init(int i, int l, int r) {if (r - l == 1) {// 葉ノードの初期化ary[i] = Node();}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);VEC(char, c, n);c.emplace_back('+');++n;SegmentTreeEx st(n / 2, Node(1, 0, 0, true, '+'));REP(i, n) {st.update(i / 2, Node(c[i], c[i + 1]));++i;}VAR(int, Q);REP(_, Q) {VAR(char, T);VAR(int, x, y);--x; --y;if (T == '!') {std::swap(c[x], c[y]);st.update(x / 2, Node(c[x / 2 * 2], c[x / 2 * 2 + 1]));st.update(y / 2, Node(c[y / 2 * 2], c[y / 2 * 2 + 1]));}else { // T == '?'Node t = st.query(x / 2, y / 2 + 1);OUT(t.getValue())BR;}}return 0;}