#include <bits/stdc++.h>
#define int long long
#define ull unsigned int
#define vi vector<int>
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ld long double
#define pii pair<int, int>
#define mt make_tuple
#define mn(a, b) a = min(a, b)
#define mx(a, b) a = max(a, b)
using namespace std;
const int INF = (int)2e9;
const int inf = (int)2e18;
const ld eps = (ld)1e-8;
const int mod = (int)10007;
const int MAXN = (int)1e4 + 1;
const int MAXC = (int)1e6 + 1;
const int MAXE = (int)1000;
const int MAXLOG = 21;
const int maxlen = (int)1e5;
const int asci = (int)256;
const int block = 480;
const ld PI = acos(-1);
const ld e = 2.7182818284;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<
pii,
null_type,
less<pii>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
template <class T>
istream& operator >>(istream &in, vector<T> &arr){
for (T &cnt : arr) {
in >> cnt;
}
return in;
};
int c = 0;
int t[400000][21];
void merge(int v) {
for (int i = 0; i <= 20; ++i) t[v][i] = 0;
for (int i = 0; i <= 20; ++i) {
for (int j = 0; j <= 20; ++j) {
t[v][min(c, i + j)] += (t[2 * v][i] * t[2 * v + 1][j]) % mod;
t[v][min(c, i + j)] %= mod;
}
}
}
void build(int v, int tl, int tr, vector<pii> &a) {
if (tl + 1 == tr) {
t[v][1] = a[tl].first, t[v][0] = a[tl].second;
return;
}
int tm = (tl + tr) / 2;
build(2 * v, tl, tm, a);
build(2 * v + 1, tm, tr, a);
merge(v);
}
void upd(int v, int tl, int tr, int pos, pii val) {
if (tl + 1 == tr) {
t[v][1] = val.first, t[v][0] = val.second;
return;
}
int tm = (tl + tr) / 2;
if (pos < tm) upd(2 * v, tl, tm, pos, val);
else upd(2 * v + 1, tm, tr, pos, val);
merge(v);
}
void solve() {
int n; cin >> n >> c;
vector<pii> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].first;
}
for (int i = 0; i < n; ++i) {
cin >> a[i].second;
}
build(1, 0, n, a);
int q; cin >> q;
while (q--) {
int pos; pii val; cin >> pos >> val.first >> val.second;
pos--;
upd(1, 0, n, pos, val);
cout << t[1][c] << "\n";
}
}
int main() {
srand(time(0));
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#endif
cout.precision(30);
solve();
return 0;
}
Compilation message
relativnost.cpp:105:10: error: '::main' must return 'int'
int main() {
^
