# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920056 | TIN | Relativnost (COCI15_relativnost) | C++17 | 2669 ms | 26540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FNAME "test"
const int M = 10007;
const int N = 1e5 + 5;
const short int C = 21;
int n, c, q;
int pos, vala, valb;
int a[N], b[N];
struct Node {
int chosen[C];
Node() {
memset(chosen, 0, sizeof(chosen));
}
} ST[3 * N];
Node merge(const Node& Node1, const Node& Node2) {
Node nNode;
for (int i = 0; i <= c; i++) {
for (int j = 0; j <= c; j++) {
nNode.chosen[min(c, i + j)] = (1LL * nNode.chosen[min(c, i + j)] + 1LL * Node1.chosen[i] * Node2.chosen[j]) % M;
}
}
return nNode;
}
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
void build(int id, int l, int r) {
if (l == r) {
ST[id].chosen[0] = b[l] % M;
ST[id].chosen[1] = a[r] % M;
return;
}
int m = (l + r) / 2;
build(id * 2, l, m);
build(id * 2 + 1, m + 1, r);
ST[id] = merge(ST[id * 2], ST[id * 2 + 1]);
}
void update(int id, int l, int r, int pos, int vala, int valb) {
if (pos < l || r < pos) return;
if (l == r) {
a[pos] = vala; ST[id].chosen[1] = a[pos] % M;
b[pos] = valb; ST[id].chosen[0] = b[pos] % M;
return;
}
int m = (l + r) / 2;
if (pos <= m) update(id * 2, l, m, pos, vala, valb);
else update(id * 2 + 1, m + 1, r, pos, vala, valb);
ST[id] = merge(ST[id * 2], ST[id * 2 + 1]);
}
void Solve() {
//Your Code
cin >> n >> c;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
build(1, 1, n);
cin >> q;
while (q--) {
cin >> pos >> vala >> valb;
update(1, 1, n, pos, vala, valb);
cout << ST[1].chosen[c] << '\n';
}
}
signed main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |