#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define pll pair<ll, int>
#define fi first
#define se second
#define pb push_back
const int N = 2e5 + 3;
const int M = 1 << 24;
const int mod = 1e4 + 7;
const int base = 300;
const ll inf = 1e12;
int pw(int k, int n)
{
int total = 1;
for (; n; n >>= 1)
{
if (n & 1)
total = total * k % mod;
k = k * k % mod;
}
return total;
}
int m, n, t, k, a[N], ans, b[N], c[N], d[N];
int dp[N], tong;
vector<pll> adj[N];
vector<int> kq, val;
ll lwr(ll x)
{
return lower_bound(kq.begin(), kq.end(), x) - kq.begin();
}
void sol()
{
cin >> n >> k;
dp[0] = 1;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
tong = 1;
for (int i = 1; i <= n; i++)
{
a[i] %= mod;
b[i] %= mod;
tong = (a[i] + b[i]) % mod * tong % mod;
for (int j = k; j > 0; j--)
dp[j] = (dp[j] * b[i] % mod + dp[j - 1] * a[i] % mod) % mod;
dp[0] = dp[0] * b[i] % mod;
}
cin >> m;
while (m-- > 0)
{
int i, x, y;
cin >> i >> x >> y;
dp[0] = dp[0] * pw(b[i], mod - 2) % mod;
for (int j = 1; j <= k; j++)
{
dp[j] = (dp[j] + mod - dp[j - 1] * a[i] % mod) % mod;
dp[j] = dp[j] * pw(b[i], mod - 2) % mod;
}
tong = tong * pw((a[i] + b[i]) % mod, mod - 2) % mod;
a[i] = x % mod;
b[i] = y % mod;
for (int j = k; j > 0; j--)
dp[j] = (dp[j] * b[i] % mod + dp[j - 1] * a[i] % mod) % mod;
dp[0] = dp[0] * b[i] % mod;
tong = (a[i] + b[i]) % mod * tong % mod;
ans = tong;
for (int j = 0; j < k; j++)
ans = (ans + mod - dp[j]) % mod;
cout << ans << '\n';
}
}
int32_t main()
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
#define task "tests"
if (fopen(task ".in", "r"))
{
freopen(task ".in", "r", stdin);
// freopen(task".out", "w", stdout);
}
int ntest = 1;
// cin >> ntest;
while (ntest-- > 0)
sol();
}
Compilation message
relativnost.cpp: In function 'int32_t main()':
relativnost.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
86 | freopen(task ".in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
4 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
5 ms |
4948 KB |
Output is correct |
| 4 |
Incorrect |
89 ms |
5964 KB |
Output isn't correct |
| 5 |
Incorrect |
140 ms |
6564 KB |
Output isn't correct |
| 6 |
Incorrect |
148 ms |
6604 KB |
Output isn't correct |
| 7 |
Incorrect |
104 ms |
6100 KB |
Output isn't correct |
| 8 |
Correct |
96 ms |
6452 KB |
Output is correct |
| 9 |
Incorrect |
137 ms |
6296 KB |
Output isn't correct |
| 10 |
Incorrect |
208 ms |
6360 KB |
Output isn't correct |
