oj.uz

답안 #98665

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

using namespace std;

typedef long long ll;

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

struct Info {
	int mul;
	int d[C];
	void upd(int a,int b) {
		mul = (a + b) % mod;
		d[0] = b % mod;
		d[1] = a % mod;
	}
	Info operator + (const Info &b) const {
		Info c;
		c.mul = (ll) mul * b.mul % mod;
		for (int i = 0; i < C; ++i) {
			for (int j = 0; i + j < C; ++j) {
				c.d[i + j] += (ll) (d[i] * b.d[j]) % mod;
				if (c.d[i + j] >= mod) {
					c.d[i + j] -= mod;
				}
			}
		}
		return c;
	}
};

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

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);
	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);
	}
	t[v] = t[v << 1] + t[v << 1 | 1];
} 

int main() {
	
	int n, c;
	
	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);
		
		int ans = t[1].mul;
		
		for (int i = 0; i < c; ++i) {
			ans -= t[1].d[i];
			if (ans < 0) {
				ans += mod;
			}
		}
		
		printf("%d\n", ans);
	}
}

Compilation message

relativnost.cpp: In function 'int main()':
relativnost.cpp:66: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:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a + i);
   ~~~~~^~~~~~~~~~~~~
relativnost.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", b + i);
   ~~~~~^~~~~~~~~~~~~
relativnost.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
relativnost.cpp:83: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);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 512 KB Output isn't correct
2 Incorrect 12 ms 512 KB Output isn't correct
3 Incorrect 13 ms 512 KB Output isn't correct
4 Incorrect 839 ms 12292 KB Output isn't correct
5 Incorrect 1238 ms 23480 KB Output isn't correct
6 Incorrect 1049 ms 23432 KB Output isn't correct
7 Incorrect 868 ms 12392 KB Output isn't correct
8 Incorrect 925 ms 23388 KB Output isn't correct
9 Incorrect 1275 ms 23672 KB Output isn't correct
10 Incorrect 1255 ms 23672 KB Output isn't correct