//{ <defines>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e5 + 5;
const short smd = 1e4 + 7;
int n, c, q;
int a[N], b[N];
struct tree {
short *v;
tree *l, *r;
void merge(int ul, int ur, bool cl = false) {
if(!cl) memset(v, 0, min(c, ul + ur) + 1 << 1);
short *fi = l->v, *se;
for(int i = 0; i <= min(ul, c); ++i, ++fi) {
if(!*fi) continue;
se = r->v;
for(int j = 0; j <= min(ur, c); ++j, ++se) {
if(!*se) continue;
short &t = v[min(c, i + j)];
t += *fi * *se % md;
if(t >= smd) t -= smd;
}
}
}
tree(int tl = 0, int tr = n - 1) {
v = (short*) calloc(min(c + 1, tr - tl + 2), 2);
if(tl < tr) {
int tm = tl + tr >> 1;
l = new tree(tl, tm);
r = new tree(tm + 1, tr);
merge(tm - tl + 1, tr - tm, true);
} else {
v[0] = b[tl];
v[1] = a[tl];
}
}
void upd(int i, int tl = 0, int tr = n - 1) {
if(tl == tr) {
v[0] = b[tl];
v[1] = a[tl];
return;
}
int tm = tl + tr >> 1;
i <= tm ? l->upd(i, tl, tm)
: r->upd(i, tm + 1, tr);
merge(tm - tl + 1, tr - tm);
}
#ifdef _LOCAL
~tree() {
free(v);
}
#endif
};
void solve() {
md = 1e4 + 7;
cin >> n >> c;
fo(n) cin >> a[i], a[i] %= md;
fo(n) cin >> b[i], b[i] %= md;
tree *t = new tree();
cin >> q;
while(q--) {
int i, na, nb; cin >> i >> na >> nb;
if(c > n) {
cout << "0\n";
continue;
}
na %= md, nb %= md, --i;
a[i] = na, b[i] = nb;
t->upd(i);
cout << t->v[c] << '\n';
}
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
relativnost.cpp: In function 'int m_bpow(ll, ll)':
relativnost.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
relativnost.cpp: In member function 'void tree::merge(int, int, bool)':
relativnost.cpp:73:46: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
if(!cl) memset(v, 0, min(c, ul + ur) + 1 << 1);
~~~~~~~~~~~~~~~~^~~
relativnost.cpp: In constructor 'tree::tree(int, int)':
relativnost.cpp:89:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int tm = tl + tr >> 1;
~~~^~~~
relativnost.cpp: In member function 'void tree::upd(int, int, int)':
relativnost.cpp:104:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int tm = tl + tr >> 1;
~~~^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
512 KB |
Output is correct |
| 2 |
Correct |
12 ms |
512 KB |
Output is correct |
| 3 |
Correct |
20 ms |
512 KB |
Output is correct |
| 4 |
Correct |
464 ms |
7672 KB |
Output is correct |
| 5 |
Correct |
1479 ms |
12536 KB |
Output is correct |
| 6 |
Correct |
2232 ms |
13232 KB |
Output is correct |
| 7 |
Correct |
993 ms |
9320 KB |
Output is correct |
| 8 |
Correct |
502 ms |
12452 KB |
Output is correct |
| 9 |
Correct |
1004 ms |
10812 KB |
Output is correct |
| 10 |
Correct |
3595 ms |
10628 KB |
Output is correct |
