답안 #602217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602217 2022-07-22T17:31:08 Z inksamurai Relativnost (COCI15_relativnost) C++17
56 / 140
4000 ms 62432 KB
#include <bits/stdc++.h>
 
// cut here
#ifdef _MSC_VER
#include <intrin.h>
#endif
 
namespace atcoder {
 
namespace internal {
 
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
 
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
 
}  // namespace internal
 
}  // namespace atcoder
 
 
namespace atcoder {
 
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
 
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
 
    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }
 
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
 
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
 
    S all_prod() { return d[1]; }
 
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
 
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
 
  private:
    int _n, size, log;
    std::vector<S> d;
 
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};
 
}  // namespace atcoder
// cut here 
// #define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=(c);i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3aFGabX ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
 
const int _c=21;

//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};

using mint=modint<10007>;
 
struct dat{
	mint dp[_c+1]{0};
};
 
dat op(dat l,dat r){
	dat res;
	rep(i,_c){
		rng(j,i,_c){
			int k=min(_c-1,i+j);
			res.dp[k]+=l.dp[i]*r.dp[j];
			// res.dp[k]%=mod;
			if(i!=j){
				res.dp[k]+=l.dp[j]*r.dp[i];
				// res.dp[k]%=mod;
			}
		}
	}
	return res;
}

dat _e;

dat e(){
	return _e;
}
 
signed main(){
_3aFGabX;
	_e.dp[0]=1;
	int n,c;
	cin>>n>>c;
	vec(pair<mint,mint>) a(n);
	rep(i,n){
		int v;
		cin>>v;
		a[i].fi=v;
	}
	rep(i,n){
		int v;
		cin>>v;
		a[i].se=v;
	}
	atcoder::segtree<dat,op,e> seg(n);
	dat now;
	rep(i,n){
		now.dp[0]=a[i].se;
		now.dp[1]=a[i].fi;
		seg.set(i,now);
	}
	int q;
	cin>>q;
	rep(_,q)
	{
		int i,_a,_b;
		cin>>i>>_a>>_b;
		i-=1;
		a[i]={_a,_b};
		now.dp[0]=a[i].se;
		now.dp[1]=a[i].fi;
		seg.set(i,now);
		dat res=seg.prod(0,n);
		mint ans=0;
		rng(i,c,_c){
			ans+=res.dp[i];
		}
		cout<<ans.x<<"\n";
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 852 KB Output is correct
2 Correct 47 ms 724 KB Output is correct
3 Correct 35 ms 824 KB Output is correct
4 Correct 3403 ms 32724 KB Output is correct
5 Execution timed out 4026 ms 61516 KB Time limit exceeded
6 Execution timed out 4056 ms 62424 KB Time limit exceeded
7 Runtime error 3626 ms 34724 KB Memory limit exceeded
8 Execution timed out 4041 ms 62432 KB Time limit exceeded
9 Execution timed out 4083 ms 59352 KB Time limit exceeded
10 Execution timed out 4091 ms 58680 KB Time limit exceeded