#806934 (C++17) No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに

提出ソース

結果

問題	No.2101 [Cherry Alpha N] ずっとこの数列だったらいいのに
ユーザー	heno239
提出日時	2022-10-14 21:44:46
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	292 ms / 6,000 ms
コード長	6,669 bytes
コンパイル時間	2,564 ms
コンパイル使用メモリ	168,248 KB
実行使用メモリ	46,308 KB
最終ジャッジ日時	2023-09-08 20:43:18
合計ジャッジ時間	18,564 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	13 ms 19,904 KB
testcase_01	AC	13 ms 19,800 KB
testcase_02	AC	14 ms 19,864 KB
testcase_03	AC	130 ms 33,468 KB
testcase_04	AC	207 ms 39,148 KB
testcase_05	AC	117 ms 29,852 KB
testcase_06	AC	186 ms 36,448 KB
testcase_07	AC	210 ms 38,468 KB
testcase_08	AC	209 ms 40,144 KB
testcase_09	AC	104 ms 28,368 KB
testcase_10	AC	97 ms 28,164 KB
testcase_11	AC	149 ms 32,524 KB
testcase_12	AC	151 ms 32,572 KB
testcase_13	AC	108 ms 29,104 KB
testcase_14	AC	119 ms 29,952 KB
testcase_15	AC	238 ms 42,368 KB
testcase_16	AC	183 ms 37,336 KB
testcase_17	AC	87 ms 25,712 KB
testcase_18	AC	292 ms 45,168 KB
testcase_19	AC	286 ms 44,608 KB
testcase_20	AC	291 ms 44,516 KB
testcase_21	AC	290 ms 46,308 KB
testcase_22	AC	286 ms 44,492 KB
testcase_23	AC	287 ms 44,136 KB
testcase_24	AC	291 ms 44,568 KB
testcase_25	AC	291 ms 44,820 KB
testcase_26	AC	289 ms 44,688 KB
testcase_27	AC	288 ms 45,344 KB
testcase_28	AC	290 ms 44,104 KB
testcase_29	AC	290 ms 44,560 KB
testcase_30	AC	291 ms 45,888 KB
testcase_31	AC	287 ms 44,488 KB
testcase_32	AC	288 ms 44,228 KB
testcase_33	AC	265 ms 44,644 KB
testcase_34	AC	270 ms 44,856 KB
testcase_35	AC	268 ms 44,116 KB
testcase_36	AC	265 ms 44,748 KB
testcase_37	AC	266 ms 45,544 KB
testcase_38	AC	79 ms 29,948 KB
testcase_39	AC	128 ms 30,188 KB
testcase_40	AC	202 ms 44,000 KB
testcase_41	AC	13 ms 20,064 KB

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

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#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;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

template<typename T>
struct BIT {
private:
	vector<T> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, T w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	T sum(int a) {
		T ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	T sum(int a, int b) {
		return sum(b) - sum(a);
	}
};

void solve() {
	int n; cin >> n;
	vector<ll> a(n), t(n);
	rep(i, n) {
		cin >> a[i] >> t[i];
	}
	BIT<ll> bt(n), btx(n);
	vector<pair<ll, P>> vp;
	rep(i, n) {
		if (a[i] == 0)continue;
		bt.add(i, a[i]);
		vp.push_back({ t[i]-1,{i,0} });
		vp.push_back({ t[i] + a[i] - 1,{i,1} });
	}
	sort(all(vp));
	int q; cin >> q;
	vector<ll> d(q), l(q), r(q);
	vector<LP> vq;
	rep(i, q) {
		cin >> d[i] >> l[i] >> r[i];
		l[i]--; r[i]--;
		vq.push_back({ d[i],i });
	}
	sort(all(vq));
	int loc = 0;
	vector<ll> ans(q);
	rep(i, vq.size()) {
		while (loc < vp.size() && vp[loc].first <= vq[i].first) {
			int id = vp[loc].second.first;
			//cout << "! " << id << " " << vp[loc].second.second << "\n";
			if (vp[loc].second.second) {
				bt.add(id, -(a[id] - 1 + t[id]));
				btx.add(id, 1);
			}
			else {
				bt.add(id, -a[id]);
				bt.add(id, a[id] - 1 + t[id]);
				btx.add(id, -1);
			}
			loc++;
		}
		int id = vq[i].second;
		ll sum = bt.sum(l[id], r[id] + 1);
		ll sumx = btx.sum(l[id], r[id] + 1);
		//cout << "? " << sum << " " << sumx << "\n";
		ans[id] = sumx * d[id] + sum;
	}
	rep(i, q)cout << ans[i] << "\n";
}




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

yukicoder

結果

テストケース

ソースコード