#903666 (C++17) No.2421 entersys?

提出ソース

結果

問題	No.2421 entersys?
ユーザー	heno239
提出日時	2023-08-13 14:22:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	370 ms / 3,000 ms
コード長	8,007 bytes
コンパイル時間	2,734 ms
コンパイル使用メモリ	182,068 KB
実行使用メモリ	45,960 KB
最終ジャッジ日時	2024-11-21 10:05:28
合計ジャッジ時間	11,538 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	9 ms 11,848 KB
testcase_01	AC	8 ms 11,976 KB
testcase_02	AC	9 ms 11,972 KB
testcase_03	AC	7 ms 11,844 KB
testcase_04	AC	7 ms 11,976 KB
testcase_05	AC	9 ms 11,972 KB
testcase_06	AC	8 ms 11,976 KB
testcase_07	AC	8 ms 11,980 KB
testcase_08	AC	8 ms 12,108 KB
testcase_09	AC	9 ms 12,232 KB
testcase_10	AC	8 ms 11,852 KB
testcase_11	AC	296 ms 36,832 KB
testcase_12	AC	294 ms 36,892 KB
testcase_13	AC	289 ms 36,816 KB
testcase_14	AC	292 ms 36,728 KB
testcase_15	AC	290 ms 36,844 KB
testcase_16	AC	299 ms 40,152 KB
testcase_17	AC	295 ms 40,172 KB
testcase_18	AC	303 ms 40,068 KB
testcase_19	AC	298 ms 40,164 KB
testcase_20	AC	297 ms 40,180 KB
testcase_21	AC	292 ms 38,144 KB
testcase_22	AC	233 ms 35,844 KB
testcase_23	AC	370 ms 45,960 KB
testcase_24	AC	365 ms 45,912 KB
testcase_25	AC	359 ms 45,820 KB
testcase_26	AC	209 ms 30,332 KB
testcase_27	AC	212 ms 30,332 KB
testcase_28	AC	212 ms 30,332 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;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 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;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

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>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
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 << 20;
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;
}
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 };

//------------------------------------

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

void solve() {
	int n; cin >> n;
	vector<string> x(n);
	vector<int> l(n), r(n);
	rep(i, n) {
		cin >> x[i] >> l[i] >> r[i]; r[i]++;
	}
	int q; cin >> q;
	vector<int> typ(q);
	vector<string> qx(q);
	vector<int> ql(q), qr(q);
	rep(i, q) {
		cin >> typ[i];
		if (typ[i] == 1) {
			cin >> qx[i] >> ql[i];
		}
		else if (typ[i] == 2) {
			cin >> ql[i];
		}
		else {
			cin >> qx[i]>>ql[i] >> qr[i];
			qr[i]++;
		}
	}
	vector<int> vx;
	rep(i, n) {
		vx.push_back(l[i]);
		vx.push_back(r[i]);
	}
	rep(i, q) {
		if (typ[i] == 1) {
			vx.push_back(ql[i]);
		}
		else if (typ[i] == 2) {
			vx.push_back(ql[i]);
		}
		else if (typ[i] == 3) {
			vx.push_back(ql[i]);
			vx.push_back(qr[i]);
		}
	}
	sort(all(vx));
	vx.erase(unique(all(vx)), vx.end());
	rep(i, n) {
		l[i] = lower_bound(all(vx), l[i]) - vx.begin();
		r[i] = lower_bound(all(vx), r[i]) - vx.begin();
	}
	rep(i, q) {
		if (typ[i] == 1) {
			ql[i] = lower_bound(all(vx), ql[i]) - vx.begin();
		}
		else if (typ[i] == 2) {
			ql[i] = lower_bound(all(vx), ql[i]) - vx.begin();
		}
		else if (typ[i] == 3) {
			ql[i] = lower_bound(all(vx), ql[i]) - vx.begin();
			qr[i] = lower_bound(all(vx), qr[i]) - vx.begin();
		}
	}
	BIT bt(vx.size());
	map<string, set<P>> mp;
	auto add = [&](string s, int l, int r) {
		mp[s].insert({ l,r });
		bt.add(l, r, 1);
	};
	rep(i, n)add(x[i], l[i], r[i]);
	rep(i, q) {
		if (typ[i] == 1) {
			set<P>& st = mp[qx[i]];
			auto itr = st.lower_bound({ ql[i] + 1,-1 });
			string ans = "No";
			if (itr != st.begin()) {
				itr--;
				if ((*itr).first <= ql[i] && ql[i] < (*itr).second) {
					ans = "Yes";
				}
			}
			cout << ans << "\n";
		}
		else if (typ[i] == 2) {
			int ans = bt.sum(ql[i], ql[i] + 1);
			cout << ans << "\n";
		}
		else {
			add(qx[i], ql[i], qr[i]);
		}
	}
}




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

yukicoder

結果

テストケース

ソースコード