#381974 (C++14) No.619 CardShuffle

提出ソース

結果

問題	No.619 CardShuffle
ユーザー	FF256grhy
提出日時	2019-09-21 05:03:51
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	545 ms / 3,000 ms
コード長	6,594 bytes
コンパイル時間	1,964 ms
コンパイル使用メモリ	188,176 KB
実行使用メモリ	11,664 KB
最終ジャッジ日時	2024-09-16 04:31:57
合計ジャッジ時間	13,726 ms
ジャッジサーバーID （参考情報）	judge6 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	541 ms 11,420 KB
testcase_17	AC	532 ms 11,620 KB
testcase_18	AC	532 ms 11,340 KB
testcase_19	AC	539 ms 11,440 KB
testcase_20	AC	368 ms 10,672 KB
testcase_21	AC	545 ms 11,220 KB
testcase_22	AC	541 ms 11,480 KB
testcase_23	AC	545 ms 11,392 KB
testcase_24	AC	544 ms 11,644 KB
testcase_25	AC	373 ms 10,764 KB
testcase_26	AC	487 ms 11,324 KB
testcase_27	AC	484 ms 11,664 KB
testcase_28	AC	495 ms 11,392 KB
testcase_29	AC	482 ms 11,504 KB
testcase_30	AC	393 ms 10,760 KB
testcase_31	AC	2 ms 5,376 KB
testcase_32	AC	382 ms 10,760 KB
testcase_33	AC	522 ms 11,392 KB
testcase_34	AC	460 ms 11,356 KB
testcase_35	AC	211 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

template<typename T> class SegmentTree {
private:
	int n, s;
	vector<T> a;
	function<T(T &, T &)> f;
	T e;
	bool ok;
public:
	SegmentTree() { n = 0; }
	SegmentTree(int nn, function<T(T &, T &)> ff, T ee) { init(nn, ff, ee); }
	void init(int nn, function<T(T &, T &)> ff, T ee) {
		n = nn;
		f = ff;
		e = ee;
		s = 1;
		while(s < n) { s *= 2; }
		a = vector<T>(2 * s, e);
		ok = true;
	}
	void shift(int & p) {
		assert(inID(p, 0, n));
		p += s;
	}
	void apply(int p, function<void(T &)> g) {
		shift(p);
		g(a[p]);
		while(p > 1) {
			p /= 2;
			a[p] = f(a[2 * p], a[2 * p + 1]);
		}
	}
	T fold_ID(int l, int r) {
		assert(ok);
		assert(inII(l, 0, n)); l += s;
		assert(inII(r, 0, n)); r += s; r--;
		T x = e, y = e;
		while(l <= r) {
			if(l % 2 == 1) { x = f(x, a[l]); l++; }
			if(r % 2 == 0) { y = f(a[r], y); r--; }
			l /= 2;
			r /= 2;
		}
		return f(x, y);
	}
	T fold_II(int l, int r) { return fold_ID(l + 0, r + 1); }
	T fold_CI(int l, int r) { return fold_ID(l + 1, r + 1); }
	T fold_CD(int l, int r) { return fold_ID(l + 1, r + 0); }
	const T & operator[](int p) {
		shift(p);
		return a[p];
	}
	T & ref(int p) {
		shift(p);
		ok = false;
		return a[p];
	}
	void update() {
		dec(i, s) { a[i] = f(a[2 * i], a[2 * i + 1]); }
		ok = true;
	}
};
#define OP(s) [&](auto & A, auto & B) { return s; }
#define AP(s) [&](auto & A) { s; }

// ---- ----

template<LL M> class ModInt {
private:
	LL v = 0;
public:
	ModInt() { }
	ModInt(LL vv) { setval(vv); }
	ModInt & setval(LL vv) { v = vv % M; if(v < 0) { v += M; } return (*this); }
	LL getval() const { return v; }
	ModInt & operator+=(const ModInt & b)       { return setval(v + b.v); }
	ModInt & operator-=(const ModInt & b)       { return setval(v - b.v); }
	ModInt & operator*=(const ModInt & b)       { return setval(v * b.v); }
	ModInt & operator/=(const ModInt & b)       { return setval(v * b.inv()); }
	ModInt & operator^=(            LU b)       { return setval(ex(v, b)); }
	ModInt   operator+ (                ) const { return ModInt(+v); }
	ModInt   operator- (                ) const { return ModInt(-v); }
	ModInt   operator+ (const ModInt & b) const { return ModInt(v + b.v); }
	ModInt   operator- (const ModInt & b) const { return ModInt(v - b.v); }
	ModInt   operator* (const ModInt & b) const { return ModInt(v * b.v); }
	ModInt   operator/ (const ModInt & b) const { return ModInt(v * b.inv()); }
	ModInt   operator^ (            LU b) const { return ModInt(ex(v, b)); }
	LL inv() const {
		LL x = (ex_gcd(v, M).FI + M) % M;
		assert(v * x % M == 1);
		return x;
	}
	LL ex(LL a, LU b) const {
		LL D = 64, x[64], y = 1;
		inc(i, D) { if((b >> i) == 0) { D = i; break; } }
		inc(i, D) { x[i] = (i == 0 ? a : x[i - 1] * x[i - 1]) % M; }
		inc(i, D) { if((b >> i) & 1) { (y *= x[i]) %= M; } }
		return y;
	}
	pair<LL, LL> ex_gcd(LL a, LL b) const {
		if(b == 0) { return MP(1, 0); }
		auto p = ex_gcd(b, a % b);
		return MP(p.SE, p.FI - (a / b) * p.SE);
	}
};
template<LL M> ModInt<M> operator+(LL a, const ModInt<M> & b) { return  b + a; }
template<LL M> ModInt<M> operator-(LL a, const ModInt<M> & b) { return -b + a; }
template<LL M> ModInt<M> operator*(LL a, const ModInt<M> & b) { return  b * a; }
template<LL M> ModInt<M> operator/(LL a, const ModInt<M> & b) { return  a * b.inv(); }
template<LL M> istream & operator>>(istream & is, ModInt<M> & b) { LL v; is >> v; b.setval(v); return is; }
template<LL M> ostream & operator<<(ostream & os, const ModInt<M> & b) { return (os << b.getval()); }

// ---- ----

typedef ModInt<1'000'000'007> MI;
typedef pair<int, vector<MI>> T;

T f(T x, T y) {
	if(x.FI == 0) { return y; }
	if(y.FI == 0) { return x; }
	
	inc(i, SI(y.SE)) {
		if(i == 0 && y.FI == -1) { x.SE.back() *= y.SE[i]; } else { x.SE.PB(y.SE[i]); }
	}
	
	if(SI(x.SE) >= 2) { 
		MI F = exchange(x.SE.front(), 0);
		MI B = exchange(x.SE.back(),  0);
		MI M = 0;
		RF(e, x.SE) { M += e; }
		x.SE = { F, M, B };
	}
	
	return x;
}

MI val(T x) {
	MI s = 0;
	RF(e, x.SE) { s += e; }
	return s;
}

int main() {
	int n;
	cin >> n;
	n = ce(n, 2);
	
	SegmentTree<T> st(n, f, MP(0, vector<MI> { }));
	{
		vector<int> a(n);
		string s, t;
		inc(i, n) {
			if(i == 0) { t = "+"; } else { cin >> t; }
			s += t;
			cin >> a[i];
		}
		inc(i, n) { st.ref(i) = MP((s[i] == '+' ? +1 : -1), vector<MI> { a[i] }); }
		st.update();
	}
	
	int Q;
	cin >> Q;
	inc(q, Q) {
		string t;
		int x, y;
		cin >> t >> x >> y;
		bool u = (x % 2 == 1);
		x /= 2; y /= 2;
		if(t == "!") {
			if(u) {
				MI vx = st[x].SE[0];
				MI vy = st[y].SE[0];
				st.apply(x, AP(A.SE[0] = vy));
				st.apply(y, AP(A.SE[0] = vx));
			} else {
				int vx = st[x].FI;
				int vy = st[y].FI;
				st.apply(x, AP(A.FI = vy));
				st.apply(y, AP(A.FI = vx));
			}
		} else {
			cout << val(st.fold_II(x, y)) << "\n";
		}
	}
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード