# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164325 | 2019-11-19T11:53:52 Z | beso123 | Relativnost (COCI15_relativnost) | C++14 | 4000 ms | 24204 KB |
#include <bits/stdc++.h> #define mod 10007 using namespace std; int n,m,Q,a[100010],b[100010],t[800100][22],sum; void update(int v){ for(int k=0;k<=m;k++) t[v][k]=0; for(int i=0;i<=m;++i) for(int j=0;j<=m;++j){ t[v][min(i+j,m)]+=((t[v*2][i]%mod)*(t[v*2+1][j])%mod); t[v][min(i+j,m)]%=mod; } for(int k=0;k<=m;k++) t[v][k]%=mod; } void Build(int v,int i,int j){ if(i==j){ t[v][0]=b[i]%mod; t[v][1]=a[i]%mod; return; } int mid=(i+j)/2; Build(v*2,i,mid); Build(v*2+1,mid+1,j); update(v); } void UPD(int v,int i,int j,int pos){ if(i==j){ t[v][0]=b[i]%mod; t[v][1]=a[i]%mod; return; } int mid=(i+j)/2; if(pos<=mid) UPD(v*2,i,mid,pos); else UPD(v*2+1,mid+1,j,pos); update(v); } int main(){ scanf("%d%d",&n,&m); for(int k=1;k<=n;k++){ scanf("%d",&a[k]); a[k]%=mod; } for(int k=1;k<=n;k++){ scanf("%d",&b[k]); b[k]%=mod; } Build(1,1,n); cin>>Q; while(Q--){ int x,na,nb; scanf("%d%d%d",&x,&na,&nb); a[x]=na%mod; b[x]=nb%mod; UPD(1,1,n,x); int ans=t[1][m]%mod; printf("%d\n",ans); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 504 KB | Output is correct |
2 | Correct | 20 ms | 504 KB | Output is correct |
3 | Correct | 38 ms | 632 KB | Output is correct |
4 | Correct | 637 ms | 12296 KB | Output is correct |
5 | Correct | 2172 ms | 24204 KB | Output is correct |
6 | Correct | 3306 ms | 24116 KB | Output is correct |
7 | Correct | 1477 ms | 12612 KB | Output is correct |
8 | Correct | 771 ms | 23928 KB | Output is correct |
9 | Correct | 1358 ms | 24056 KB | Output is correct |
10 | Execution timed out | 4024 ms | 23920 KB | Time limit exceeded |