oj.uz

답안 #164341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
164341 2019-11-19T12:17:04 Z beso123 Relativnost (COCI15_relativnost) C++14
126 / 140
 4000 ms 24228 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(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
cin>>n>>m;
for(int k=1;k<=n;k++){
 cin>>a[k];
    a[k]%=mod;
}
for(int k=1;k<=n;k++){
 cin>>b[k];
    b[k]%=mod;
}
Build(1,1,n);
cin>>Q;
while(Q--){
   int x,na,nb;
cin>>x>>na>>nb;
   a[x]=na%mod;
   b[x]=nb%mod;
    UPD(1,1,n,x);
    int ans=t[1][m]%mod;
  cout<<ans<<'\n';
}
return 0;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 20 ms 632 KB Output is correct
3 Correct 38 ms 632 KB Output is correct
4 Correct 628 ms 12532 KB Output is correct
5 Correct 2174 ms 24228 KB Output is correct
6 Correct 3312 ms 24152 KB Output is correct
7 Correct 1403 ms 12592 KB Output is correct
8 Correct 729 ms 23800 KB Output is correct
9 Correct 1350 ms 24084 KB Output is correct
10 Execution timed out 4025 ms 24064 KB Time limit exceeded