oj.uz

답안 #1020053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020053 2024-07-11T13:17:48 Z vako_p Relativnost (COCI15_relativnost) C++14
42 / 140
 430 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int mxN = 5e5 + 5;
ll n,C,a[mxN],b[mxN],q,mod = 10007,ans,sz,v[mxN][50],v1[mxN],i,a1,b1;

struct segtree{	
	void init(){	
		sz = 1;
		while(sz < n) sz *= 2;
		for(int i = 0; i < 2 * sz; i++) v[i][0] = v1[i] = 1;
	}
	
	void set(ll i, ll x, ll l, ll r){
		if(r - l == 1){
			v[x][0] = b[i];
			v[x][1] = a[i];
			v1[x] = (a[i] + b[i]) % mod;
			return;
		}	
		ll mid = l + (r - l) / 2;
		if(i < mid) set(i, 2 * x + 1, l, mid);
		else set(i, 2 * x + 2, mid, r);
		for(int j = 0; j < C; j++) v[x][j] = 0;
		for(int j = 0; j < C; j++) for(int k = 0; k + j < C; k++) 
			v[x][k + j] = (v[x][j + k] + v[2 * x + 1][j] * v[2 * x + 2][k]) % mod;	
		v1[x] = v1[2 * x + 1] *  v1[2 * x + 2] % mod;
	}
	
	void set(ll i){
		set(i, 0, 0, sz);
	}
};


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> C;
	segtree s;
	s.init();
	for(int i = 0; i < n; i++){
		cin >> a[i];
		a[i] %= mod;
	}
	for(int i = 0; i < n; i++){
		cin >> b[i];
		b[i] %= mod;
		s.set(i);
	}
	cin >> q;
	while(q--){
		cin >> i >> a1 >> b1;
		i--;
		a[i] = a1 % mod;
		b[i] = b1 % mod;
		s.set(i);
		ans = v1[0];
		for(int i1 = 0; i1 < C; i1++){
			ans = (ans - v[0][i1] + mod) % mod;
		}
		cout << ans << '\n';
	}
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8540 KB Output is correct
2 Correct 5 ms 8540 KB Output is correct
3 Correct 10 ms 8684 KB Output is correct
4 Runtime error 178 ms 58192 KB Memory limit exceeded
5 Runtime error 11 ms 65536 KB Execution killed with signal 9
6 Runtime error 13 ms 65536 KB Execution killed with signal 9
7 Runtime error 430 ms 58468 KB Memory limit exceeded
8 Runtime error 16 ms 65536 KB Execution killed with signal 9
9 Runtime error 12 ms 65536 KB Execution killed with signal 9
10 Runtime error 12 ms 65536 KB Execution killed with signal 9