Submission #164336

#TimeUsernameProblemLanguageResultExecution timeMemory
164336beso123Relativnost (COCI15_relativnost)C++14
126 / 140
4045 ms24184 KiB
#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 (stderr)

relativnost.cpp: In function 'int main()':
relativnost.cpp:41:6: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf("%d%d",&n,&m);
 ~~~~~^~~~~~~~~~~~~~
relativnost.cpp:43:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&a[k]);
  ~~~~~^~~~~~~~~~~~
relativnost.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&b[k]);
  ~~~~~^~~~~~~~~~~~
relativnost.cpp:54:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d%d",&x,&na,&nb);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...