# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78789 | ekrem | Relativnost (COCI15_relativnost) | C++98 | 4048 ms | 14932 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 st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 10007
#define N 100005
using namespace std;
typedef long long ll;
int n, c, q, a[N], b[N];
ll dp[22][N];
int main() {
// freopen("in.txt", "r", stdin);
// freopen("outt.txt", "w", stdout);
scanf("%d %d",&n ,&c);
for(int i = 1; i <= n; i++)
scanf("%d",a + i);
for(int i = 1; i <= n; i++)
scanf("%d",b + i);
dp[0][0] = 1;
scanf("%d",&q);
while(q--){
int x, y, z;
scanf("%d %d %d",&x ,&y ,&z);
a[x] = y;
b[x] = z;
for(int i = 1; i <= n; i++)
for(int k = 0; k <= c; k++)
dp[k][i] = (1ll*dp[k - (k != 0)][i - 1]*a[i]%mod + 1ll*dp[k][i - 1]*b[i]%mod)%mod;
printf("%lld\n", dp[c][n]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |