#808756 (C++17) No.469 区間加算と一致検索の問題

提出ソース

結果

問題	No.469 区間加算と一致検索の問題
ユーザー	heno239
提出日時	2022-10-19 04:00:44
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	117 ms / 5,000 ms
コード長	6,587 bytes
コンパイル時間	1,899 ms
コンパイル使用メモリ	162,936 KB
実行使用メモリ	56,676 KB
最終ジャッジ日時	2024-06-29 09:09:49
合計ジャッジ時間	8,237 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	33 ms 35,688 KB
testcase_01	AC	33 ms 35,456 KB
testcase_02	AC	33 ms 36,844 KB
testcase_03	AC	35 ms 35,712 KB
testcase_04	AC	35 ms 35,820 KB
testcase_05	AC	35 ms 35,840 KB
testcase_06	AC	37 ms 36,096 KB
testcase_07	AC	37 ms 36,080 KB
testcase_08	AC	38 ms 36,096 KB
testcase_09	AC	36 ms 35,820 KB
testcase_10	AC	36 ms 35,564 KB
testcase_11	AC	34 ms 35,712 KB
testcase_12	AC	37 ms 36,072 KB
testcase_13	AC	35 ms 35,948 KB
testcase_14	AC	32 ms 35,692 KB
testcase_15	AC	35 ms 35,824 KB
testcase_16	AC	37 ms 35,968 KB
testcase_17	AC	36 ms 35,944 KB
testcase_18	AC	37 ms 36,076 KB
testcase_19	AC	32 ms 35,692 KB
testcase_20	AC	36 ms 36,096 KB
testcase_21	AC	33 ms 35,568 KB
testcase_22	AC	33 ms 35,692 KB
testcase_23	AC	63 ms 38,384 KB
testcase_24	AC	63 ms 38,504 KB
testcase_25	AC	63 ms 38,508 KB
testcase_26	AC	63 ms 38,400 KB
testcase_27	AC	64 ms 38,508 KB
testcase_28	AC	64 ms 38,380 KB
testcase_29	AC	64 ms 38,400 KB
testcase_30	AC	65 ms 38,508 KB
testcase_31	AC	66 ms 38,368 KB
testcase_32	AC	65 ms 38,500 KB
testcase_33	AC	115 ms 56,584 KB
testcase_34	AC	116 ms 56,676 KB
testcase_35	AC	115 ms 56,576 KB
testcase_36	AC	117 ms 56,572 KB
testcase_37	AC	115 ms 56,456 KB
testcase_38	AC	105 ms 55,168 KB
testcase_39	AC	106 ms 55,296 KB
testcase_40	AC	104 ms 55,168 KB
testcase_41	AC	102 ms 55,160 KB
testcase_42	AC	103 ms 55,168 KB
testcase_43	AC	104 ms 55,168 KB
testcase_44	AC	105 ms 55,152 KB
testcase_45	AC	106 ms 55,224 KB
testcase_46	AC	104 ms 55,196 KB
testcase_47	AC	105 ms 55,168 KB
testcase_48	AC	33 ms 35,568 KB
testcase_49	AC	34 ms 35,564 KB
testcase_50	AC	105 ms 55,168 KB
testcase_51	AC	103 ms 55,040 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 };
//-----------------------------------------

bool isp(int x) {
	if (x == 1)return false;
	for (int i = 2; i * i <= x; i++) {
		if (x % i == 0)return false;
	}
	return true;
}
//1.1*10^9だと2.2*10^9がintでoverflowする
mt19937 mtle(time(0));
uniform_int_distribution<> udle(900000000, 1000000000);
int findmodp() {
	int le = udle(mtle);
	while (!isp(le))le++;
	return le;
}
using ar = array<ll, 2>;

ar ms;
ar ts;

ar rhs[1000005];
void init() {
	rep(i, 2) {
		ms[i] = findmodp();
		ts[i] = findmodp();
		while (ts[i] % ms[i] == 0) {
			ts[i] = findmodp();
		}
		ts[i] %= ms[i];
	}
	rhs[0] = { 1,1 };
	rep(i, 1000004) {
		rep(j, 2) {
			rhs[i + 1][j] = rhs[i][j] * ts[j] % ms[j];
		}
	}
}

ar operator*(ar a, ll v) {
	rep(j, 2) {
		ll adv = v % ms[j];
		if (adv < 0)adv += ms[j];
		a[j] *= adv; a[j] %= ms[j];
	}
	return a;
}
ar operator+(ar a, ar b) {
	rep(j, 2) {
		a[j] += b[j]; if (a[j] >= ms[j])a[j] -= ms[j];
	}
	return a;
}
ar operator-(ar a, ar b) {
	rep(j, 2) {
		a[j] -= b[j]; if (a[j] < 0)a[j] += ms[j];
	}
	return a;
}

void solve(){
	int n, q; cin >> n >> q;
	map<ar, int> mp;
	ar cur = { 0,0 };
	mp[cur] = 0;
	vector<ar> sumh(n + 1);
	rep(i, n) {
		sumh[i + 1] = sumh[i] + rhs[i];
	}
	rep(i, q) {
		char c; cin >> c;
		if (c == '!') {
			int l, r, val; cin >> l >> r >> val;
			ar z = sumh[r] - sumh[l];
			cur = cur + z * val;
			if (mp.find(cur) == mp.end()) {
				mp[cur] = i + 1;
			}
		}
		else {
			int ans = mp[cur];
			cout << ans << "\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

結果

テストケース

ソースコード