# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165309 | egekabas | Relativnost (COCI15_relativnost) | C++14 | 4037 ms | 37728 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>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll n, c, q, mod = 10007;
ll a[100009];
ll b[100009];
ll seg[400009][25];
void merge(ll v){
for(ll i = 0; i <= c; ++i)
seg[v][i] = 0;
for(ll i = 0; i <= c; ++i)
for(ll j = 0; j <= c; ++j){
seg[v][min(c, i+j)] += seg[2*v][i]*seg[2*v+1][j];
seg[v][min(c, i+j)] %= mod;
}
}
void modify(ll p) {
seg[p+n][0] = b[p]%mod;
seg[p+n][1] = a[p]%mod;
p += n;
for (; p > 1; p /= 2){
merge(p/2);
}
}
int main() {
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
scanf("%lld %lld", &n, &c);
for(ll i = 0; i < n; ++i)
scanf("%lld", &a[i]);
for(ll i = 0; i < n; ++i)
scanf("%lld", &b[i]);
for(ll i = 0; i < n; ++i){
seg[i+n][0] = b[i]%mod;
seg[i+n][1] = a[i]%mod;
}
for(ll i = n-1; i >= 1; --i)
merge(i);
scanf("%lld", &q);
while(q--){
ll t1, t2, t3;
scanf("%lld %lld %lld", &t1, &t2, &t3);
--t1;
a[t1] = t2;
b[t1] = t3;
modify(t1);
printf("%lld\n", seg[1][c]);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |