Submission #374104

#TimeUsernameProblemLanguageResultExecution timeMemory
374104NimbostratusRelativnost (COCI15_relativnost)C++17
0 / 140
4091 ms9996 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ub upper_bound #define lb lower_bound #define clean(a,s) memset((a),0,sizeof((a)[0])*(s)) #define all(x) (x).begin() , (x).end() #define fi first #define se second #define int long long using pii = pair<int,int>; using ll = long long; const int maxn = 1e5+5; const int maxc = 25; const int inf = 2e9; const int mod = 10007; int n,c,q,a[maxn],b[maxn],dp[maxn][maxc]; int32_t main () { //freopen("in","r",stdin); freopen("out","w",stdout); ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); cin >> n >> c; for(int i=1;i<=n;i++) cin >> a[i] , a[i] %= mod; for(int i=1;i<=n;i++) cin >> b[i] , b[i] %= mod; dp[0][0] = 1; for(int i=1;i<=n;i++) { dp[i][0] = dp[i-1][0]*b[i]%mod; for(int j=1;j<=i;j++) dp[i][j] = (a[i]*dp[i-1][j-1]%mod + b[i]*dp[i-1][j]%mod)%mod; } cin >> q; while(q--) { int idx,aa,bb; cin >> idx >> aa >> bb; a[idx] = aa%mod; b[idx] = bb%mod; for(int i=idx;i<=n;i++) { dp[i][0] = (dp[i-1][0]*b[i])%mod; for(int j=1;j<=i;j++) dp[i][j] = (a[i]*dp[i-1][j-1]%mod + b[i]*dp[i-1][j]%mod)%mod; } int ans = 0; for(int i=c;i<=n;i++) ans = (ans + dp[n][i])%mod; cout << ans << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...