제출 #1183453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183453		12345678	Relativnost (COCI15_relativnost)	C++20	140 / 140	2107 ms	23048 KiB

relativnost

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5, cx=21, mod=10007;

int n, c, a[nx], b[nx], q, idx, x, y;

struct segtree
{
    int d[4*nx][cx];
    void merge(int i)
    {
        for (int j=0; j<=c; j++) d[i][j]=0;
        for (int j=0; j<=c; j++) for (int k=0; k<=c; k++) d[i][min(j+k, c)]=(d[i][min(j+k, c)]+d[2*i][j]*d[2*i+1][k])%mod;
    }
    void build(int l, int r, int i)
    {
        if (l==r) return d[i][0]=b[l]%mod, d[i][1]=a[l]%mod, void();
        int md=(l+r)/2;
        build(l, md, 2*i);
        build(md+1, r, 2*i+1);
        merge(i);
    }
    void update(int l, int r, int i, int idx)
    {
        if (idx<l||r<idx) return;
        if (l==r) return d[i][0]=b[l]%mod, d[i][1]=a[l]%mod, void();
        int md=(l+r)/2;
        update(l, md, 2*i, idx);
        update(md+1, r, 2*i+1, idx);
        merge(i);
    }
} s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>c;
    for (int i=1; i<=n; i++) cin>>a[i];
    for (int i=1; i<=n; i++) cin>>b[i];
    s.build(1, n, 1);
    cin>>q;
    while (q--)
    {
        cin>>idx>>x>>y;
        a[idx]=x, b[idx]=y;
        s.update(1, n, 1, idx);
        cout<<s.d[1][c]<<'\n';
    }
}

• Subtask 1: 140 / 140