#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll mod3=10007;
const ll inf=1e18*4;
const ld pai=acos(-1);
ll n,c;
ll a[100009];
ll b[100009];
ll dp[100009][22];
ll bt(ll id,ll num){
if(num>c)num=c;
if(id==n)return (num>=c);
ll &ret=dp[id][num];
if(ret!=-1)return ret;
ret=((bt(id+1,num)*b[id])%mod3+(bt(id+1,num+1)*a[id])%mod3)%mod3;
return ret;
}
int main(){
cin>>n>>c;
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
int q;cin>>q;
while(q--){
mem(dp,-1);
ll id,x,y;cin>>id>>x>>y;
id--;
a[id]=x%mod3;
b[id]=y%mod3;
cout<<bt(0,0)<<endl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1417 ms |
17784 KB |
Output is correct |
2 |
Correct |
1923 ms |
17784 KB |
Output is correct |
3 |
Correct |
1667 ms |
17784 KB |
Output is correct |
4 |
Execution timed out |
4017 ms |
22904 KB |
Time limit exceeded |
5 |
Execution timed out |
4085 ms |
26104 KB |
Time limit exceeded |
6 |
Execution timed out |
4077 ms |
26508 KB |
Time limit exceeded |
7 |
Execution timed out |
4085 ms |
23800 KB |
Time limit exceeded |
8 |
Execution timed out |
4066 ms |
26488 KB |
Time limit exceeded |
9 |
Execution timed out |
4075 ms |
24996 KB |
Time limit exceeded |
10 |
Execution timed out |
4078 ms |
24568 KB |
Time limit exceeded |