結果

問題 No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー heno239heno239
提出日時 2020-08-18 15:31:00
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 147 ms / 5,000 ms
コード長 4,466 bytes
コンパイル時間 1,248 ms
コンパイル使用メモリ 120,892 KB
実行使用メモリ 71,808 KB
最終ジャッジ日時 2024-10-12 02:48:33
合計ジャッジ時間 4,383 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
68,864 KB
testcase_01 AC 52 ms
68,736 KB
testcase_02 AC 52 ms
68,736 KB
testcase_03 AC 51 ms
68,736 KB
testcase_04 AC 52 ms
68,864 KB
testcase_05 AC 52 ms
68,736 KB
testcase_06 AC 56 ms
68,864 KB
testcase_07 AC 53 ms
68,736 KB
testcase_08 AC 51 ms
68,864 KB
testcase_09 AC 94 ms
70,144 KB
testcase_10 AC 91 ms
68,864 KB
testcase_11 AC 75 ms
69,376 KB
testcase_12 AC 94 ms
70,144 KB
testcase_13 AC 58 ms
68,992 KB
testcase_14 AC 89 ms
71,808 KB
testcase_15 AC 117 ms
71,680 KB
testcase_16 AC 127 ms
71,808 KB
testcase_17 AC 147 ms
71,808 KB
testcase_18 AC 103 ms
71,680 KB
testcase_19 AC 105 ms
71,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod/300;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 22;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

struct SegT {
private:
	int n; vector<P> node;vector<int> lazy;
	const P init_c = { 0,0 };
public:
	SegT(int sz) {
		n = 1;
		while (n < sz)n <<= 1;
		node.resize(2 * n - 1, init_c);
		lazy.resize(2 * n - 1, 0);
	}
	P f(P a, P b) {
		return { a.first + b.first,a.second + b.second };
	}
	void eval(int k, int l, int r) {
		if (lazy[k] == 0)return;
		if (lazy[k]==1) {
			node[k] = { r - l,0 };
		}
		else {
			node[k] = { 0,r - l };
		}
		if (r - l > 1) {
			lazy[2 * k + 1] = lazy[k];
			lazy[2 * k + 2] = lazy[k];
		}
		lazy[k] = 0;
	}
	void add(ll x, int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return;
		if (a <= l && r <= b) {
			lazy[k] += x; eval(k, l, r);
		}
		else {
			add(x, a, b, k * 2 + 1, l, (l + r) / 2);
			add(x, a, b, k * 2 + 2, (l + r) / 2, r);
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	P query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = n;
		eval(k, l, r);
		if (r <= a || b <= l)return init_c;
		if (a <= l && r <= b)return node[k];
		else {
			P vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			P vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};
void solve() {
	int n, q; cin >> n >> q;
	SegT st(n);
	ll ans[2] = {};
	rep(i, q) {
		int x, l, r; cin >> x >> l >> r;
		if (x == 0) {
			P p = st.query(l, r + 1);
			if (p.first > p.second)ans[0] += p.first;
			else if (p.first < p.second)ans[1] += p.second;
		}
		else {
			st.add(x, l, r + 1);
		}
	}
	P p = st.query(0, n);
	ans[0] += p.first; ans[1] += p.second;
	cout << ans[0] << " " << ans[1] << "\n"; 

}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
		solve();
	return 0;
}
0