oj.uz

Submission #51448

# Submission time Handle Problem Language Result Execution time Memory
51448 2018-06-18T02:54:06 Z MoesashiMinamoto Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 764 ms 14264 KB 
#include <bits/stdc++.h>

using namespace std;
#define int 	long long
int n, q, s, t;
long long a[200005];

long long it[800005], lazy[800005];
long long res = 0;

void init(int k, int l, int r)
{
	if (l == r)
	{
		it[k] = a[l];
		return;
	}
	int mid = (l + r)/2;
	init(k * 2, l, mid);
	init(k * 2 + 1, mid+1, r);
	it[k] = it[k * 2] + it[k * 2 + 1];
}

void update(int k, int l, int r, int L, int R, int val)
{
	if (l > R || r < L) return;
	if (L <= l && R >= r) 
	{
		it[k] += val * (r - l + 1);
		lazy[k] += val;
		return;
	}
    int mid = (l+r) / 2;
    int t = lazy[k];
    lazy[k * 2] += t;
    lazy[k * 2 + 1] += t;
    it[k * 2] += t * (mid - l + 1);
    it[k * 2 + 1] += t * (r - mid);
    lazy[k] = 0;
	update(k * 2, l, mid, L, R, val);
	update(k * 2 + 1, mid + 1, r, L, R, val);
	it[k] = it[k * 2] + it[k * 2 + 1];
}

long long get(int k, int l, int r, int L, int R)
{
    if (R < l || L > r) return 0ll;
    if (L <= l && r <= R) {
    	return it[k];
    }
    int mid = (l+r) / 2;
    int t = lazy[k];
    lazy[k * 2] += t;
    lazy[k * 2 + 1] += t;
    it[k * 2] += t * (mid - l + 1);
    it[k * 2 + 1] += t * (r - mid);
    lazy[k] = 0;
    return get(k * 2, l, mid, L, R) + get(k * 2 + 1, mid + 1, r, L, R);
}

void in()
{
	scanf("%lld%lld%lld%lld", &n, &q, &s, &t);
	for (int i = 0; i <= n; i++)
	{
		scanf("%lld", &a[i]);
	}
}

void ou()
{
	printf("%lld\n", res);
}

void solve()
{
	init(1, 1, n);
	for (int i = 1; i <= n; i++)
	{
		res += (a[i-1] - a[i] < 0) ? (s * (a[i-1] - a[i])) : (t * (a[i-1] - a[i]));
	}
	for (int i = 1; i <= q; i++)
	{
		int l, r, x;
		scanf("%lld%lld%lld", &l, &r, &x);
		long long precl, precr;
		precl = get(1, 1, n, l, l);
		precr = get(1, 1, n, r, r);
		update(1, 1, n, l, r, x);
		long long curl = get(1, 1, n, l, l);
		long long curr = get(1, 1, n, r, r);
		long long re1 = 0, re2 = 0;
		a[l - 1] = get(1, 1, n, l-1, l-1);
		re1 += (a[l-1] - precl < 0) ? (s * (a[l-1] - precl)) : (t * (a[l-1] - precl));
		re2 += (a[l-1] - curl < 0) ? (s * (a[l-1] - curl)) : (t * (a[l-1] - curl));
		if (r < n)
		{
			a[r+1] = get(1, 1, n, r+1, r+1);
			re1 += (precr - a[r+1] < 0) ? (s * (precr - a[r+1])) : (t * (precr - a[r+1]));
			re2 += (curr - a[r+1] < 0) ? (s * (curr - a[r+1])) : (t * (curr - a[r+1]));
		}
		res += re2 - re1;
		ou();
	}
}


signed main()
{
	in();
	solve();
}

Compilation message

foehn_phenomena.cpp: In function 'void in()':
foehn_phenomena.cpp:63:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld", &n, &q, &s, &t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:66:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]);
   ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp: In function 'void solve()':
foehn_phenomena.cpp:85:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &l, &r, &x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 5 ms 484 KB Output is correct
3 Correct 6 ms 704 KB Output is correct
4 Correct 6 ms 704 KB Output is correct
5 Correct 6 ms 704 KB Output is correct
6 Correct 6 ms 704 KB Output is correct
7 Correct 6 ms 704 KB Output is correct
8 Correct 6 ms 704 KB Output is correct
9 Correct 6 ms 704 KB Output is correct
10 Correct 7 ms 704 KB Output is correct
11 Correct 7 ms 704 KB Output is correct
12 Correct 9 ms 704 KB Output is correct
13 Correct 5 ms 704 KB Output is correct
14 Correct 7 ms 704 KB Output is correct
15 Correct 6 ms 704 KB Output is correct
16 Correct 5 ms 704 KB Output is correct
17 Correct 4 ms 704 KB Output is correct
18 Correct 6 ms 704 KB Output is correct
19 Correct 2 ms 704 KB Output is correct
20 Correct 3 ms 712 KB Output is correct
21 Correct 2 ms 712 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 721 ms 11720 KB Output is correct
2 Correct 707 ms 12424 KB Output is correct
3 Correct 688 ms 13064 KB Output is correct
4 Correct 672 ms 13064 KB Output is correct
5 Correct 663 ms 13064 KB Output is correct
6 Correct 293 ms 13064 KB Output is correct
7 Correct 280 ms 13064 KB Output is correct
8 Correct 574 ms 13356 KB Output is correct
9 Correct 630 ms 13680 KB Output is correct
10 Correct 589 ms 13680 KB Output is correct
11 Correct 388 ms 13680 KB Output is correct
12 Correct 304 ms 13680 KB Output is correct
13 Correct 445 ms 13680 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 5 ms 484 KB Output is correct
3 Correct 6 ms 704 KB Output is correct
4 Correct 6 ms 704 KB Output is correct
5 Correct 6 ms 704 KB Output is correct
6 Correct 6 ms 704 KB Output is correct
7 Correct 6 ms 704 KB Output is correct
8 Correct 6 ms 704 KB Output is correct
9 Correct 6 ms 704 KB Output is correct
10 Correct 7 ms 704 KB Output is correct
11 Correct 7 ms 704 KB Output is correct
12 Correct 9 ms 704 KB Output is correct
13 Correct 5 ms 704 KB Output is correct
14 Correct 7 ms 704 KB Output is correct
15 Correct 6 ms 704 KB Output is correct
16 Correct 5 ms 704 KB Output is correct
17 Correct 4 ms 704 KB Output is correct
18 Correct 6 ms 704 KB Output is correct
19 Correct 2 ms 704 KB Output is correct
20 Correct 3 ms 712 KB Output is correct
21 Correct 2 ms 712 KB Output is correct
22 Correct 721 ms 11720 KB Output is correct
23 Correct 707 ms 12424 KB Output is correct
24 Correct 688 ms 13064 KB Output is correct
25 Correct 672 ms 13064 KB Output is correct
26 Correct 663 ms 13064 KB Output is correct
27 Correct 293 ms 13064 KB Output is correct
28 Correct 280 ms 13064 KB Output is correct
29 Correct 574 ms 13356 KB Output is correct
30 Correct 630 ms 13680 KB Output is correct
31 Correct 589 ms 13680 KB Output is correct
32 Correct 388 ms 13680 KB Output is correct
33 Correct 304 ms 13680 KB Output is correct
34 Correct 445 ms 13680 KB Output is correct
35 Correct 751 ms 13680 KB Output is correct
36 Correct 712 ms 13680 KB Output is correct
37 Correct 689 ms 14264 KB Output is correct
38 Correct 764 ms 14264 KB Output is correct
39 Correct 717 ms 14264 KB Output is correct
40 Correct 696 ms 14264 KB Output is correct
41 Correct 760 ms 14264 KB Output is correct
42 Correct 689 ms 14264 KB Output is correct
43 Correct 660 ms 14264 KB Output is correct
44 Correct 752 ms 14264 KB Output is correct
45 Correct 715 ms 14264 KB Output is correct
46 Correct 709 ms 14264 KB Output is correct
47 Correct 285 ms 14264 KB Output is correct
48 Correct 404 ms 14264 KB Output is correct
49 Correct 628 ms 14264 KB Output is correct
50 Correct 397 ms 14264 KB Output is correct
51 Correct 296 ms 14264 KB Output is correct
52 Correct 448 ms 14264 KB Output is correct