| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 419893 | 2021-06-07T16:11:41 Z | acm | Relativnost (COCI15_relativnost) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
const int mod = 10007;
int n, c, q, a[100005], b[100005], t[200005], dp[200005][21];
void merge(int v) {
t[v] = (t[v + v] * t[v + v + 1]) % mod;
for (int i = 0; i <= c; i++) dp[v][i] = 0;
for (int i = 0; i <= c; i++) {
for (int j = 0; i + j <= c; j++) {
dp[v][i + j] += (dp[v + v][i] * dp[v + v + 1][j]) % mod;
if (mod <= dp[v][i + j]) dp[v][i + j] -= mod;
}
}
}
void upd(int v) {
int x = ((pc(n) < 2) + 1) * (1 << __lg(n));
v += x;
t[v] = (a[v - x] + b[v - x]);
if (mod <= t[v]) t[v] -= mod;
dp[v][0] = b[v - x];
dp[v][1] = a[v - x];
for (; v /= 2;) merge(v);
}
int main() {
speed;
precision;
// code
cin >> n >> c;
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] %= mod;
}
for (int i = 0; i < n; i++) {
cin >> b[i];
b[i] %= mod;
upd(i);
}
cin >> q;
while (q--) {
int x, y, z;
cin >> x >> y >> z;
--x;
a[x] = y % mod;
b[x] = z % mod;
upd(x);
x = t[1];
for (int i = 0; i < c; i++) {
x -= dp[1][i];
if (x < 0) x += mod;
}
cout << x << "\n";
}
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}