답안 #98669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98669 2019-02-25T03:29:14 Z IOrtroiii Relativnost (COCI15_relativnost) C++11
0 / 140
51 ms 33792 KB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 100005;
const int C = 22;
const int mod = 10007;

int n, c;

struct Info {
	int d[C];
	Info() {
		memset(d, 0, sizeof d);
	}
	void upd(int a,int b) {
		d[0] = b % mod;
		d[1] = a % mod;
	}
};

int a[N], b[N];
Info t[N << 2];

void Merge(Info &v, Info lv, Info rv) {
	for (int i = 0; i <= c; ++i) {
		v.d[i] = 0;
	}
	for (int i = 0; i <= c; ++i) {
		for (int j = 0; j <= c; ++j) {
			(v.d[min(i + j, c)] += (ll) (lv.d[i] * rv.d[j])) %= mod;
		}
	}
}

void build(int v,int l,int r) {
	if (l == r) {
		t[v].upd(a[l], b[l]);
		return;
	}
	int md = (l + r) >> 1;
	build(v << 1, l, md);
	build(v << 1 | 1, md + 1, r);
	Merge(t[v], t[v << 1], t[v << 1 | 1]);
}

void upd(int v,int l,int r,int p,int a,int b) {
	if (l == r) {
		t[v].upd(a, b);
		return;
	}
	int md = (l + r) >> 1;
	if (p <= md) {
		upd(v << 1, l, md, p, a, b);
	} else {
		upd(v << 1 | 1, md + 1, r, p, a, b);
	}
	Merge(t[v], t[v << 1], t[v << 1 | 1]);
} 

int main() {
	
	scanf("%d %d", &n, &c);
	
	for (int i = 1; i <= n; ++i) {
		scanf("%d", a + i);
	} 
	
	for (int i = 1; i <= n; ++i) {
		scanf("%d", b + i);
	}
	
	int q;
	
	build(1, 1, n);
	scanf("%d", &q);
	while (q--) {
		int p, ap, bp;
		
		scanf("%d %d %d", &p, &ap, &bp);
		
		upd(1, 1, n, p, ap, bp);
		printf("%d\n", t[1].d[c]);
	}
}

Compilation message

relativnost.cpp: In function 'int main()':
relativnost.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &c);
  ~~~~~^~~~~~~~~~~~~~~~~
relativnost.cpp:68:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
   ~~~~~^~~~~~~~~~~~~
relativnost.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", b + i);
   ~~~~~^~~~~~~~~~~~~
relativnost.cpp:78:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
relativnost.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &p, &ap, &bp);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Runtime error 44 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Runtime error 40 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Runtime error 44 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Runtime error 49 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Runtime error 42 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 47 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 42 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 44 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
9 Runtime error 38 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Runtime error 51 ms 33792 KB Execution killed with signal 9 (could be triggered by violating memory limits)