oj.uz

답안 #978733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978733 2024-05-09T14:52:35 Z raspy Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 441 ms 13136 KB 
#include <iostream>

#define int long long

using namespace std;

int a[200005];
int raz[200005];

int32_t main()
{
	int n, q, s, t;
	cin >> n >> q >> s >> t;
	for (int i = 0; i <= n; i++)
		cin >> a[i];
	int rez = 0;
	for (int i = 0; i < n; i++)
	{
		raz[i] = a[i]-a[i+1];
		rez += raz[i]*(raz[i] < 0 ? s : t);
	}
	while (q--)
	{
		int l, r, x;
		cin >> l >> r >> x;
		l--;
		if (x < 0)
		{
			// cout << "tets\n";
			x = abs(x);
			if (raz[l] < 0)
				rez -= raz[l]*s;
			else
				rez -= raz[l]*t;
			raz[l] += x;
			// cout << l << " " << raz[l] << " " << x << "\n";
			if (raz[l] < 0)
				rez += raz[l]*s;
			else
				rez += raz[l]*t;
			if (r < n)
			{
				if (raz[r] < 0)
					rez -= raz[r]*s;
				else
					rez -= raz[r]*t;
				raz[r] -= x;
				if (raz[r] < 0)
					rez += raz[r]*s;
				else
					rez += raz[r]*t;
			}
		}
		else if (x > 0)
		{
			x = abs(x);
			if (raz[l] < 0)
				rez -= raz[l]*s;
			else
				rez -= raz[l]*t;
			raz[l] -= x;
			if (raz[l] < 0)
				rez += raz[l]*s;
			else
				rez += raz[l]*t;
			if (r < n)
			{
				if (raz[r] < 0)
					rez -= raz[r]*s;
				else
					rez -= raz[r]*t;
				raz[r] += x;
				if (raz[r] < 0)
					rez += raz[r]*s;
				else
					rez += raz[r]*t;
			}
		}
		// for (int i = 0; i < n; i++)
		// 	cout << raz[i] << " ";
		// cout << "\n";
		cout << rez << "\n";
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 7 ms 2572 KB Output is correct
3 Correct 5 ms 2396 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 5 ms 2576 KB Output is correct
6 Correct 5 ms 2396 KB Output is correct
7 Correct 5 ms 2576 KB Output is correct
8 Correct 5 ms 2396 KB Output is correct
9 Correct 5 ms 2396 KB Output is correct
10 Correct 5 ms 2652 KB Output is correct
11 Correct 7 ms 2500 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 5 ms 2392 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 8 ms 2576 KB Output is correct
17 Correct 5 ms 2396 KB Output is correct
18 Correct 4 ms 2572 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 426 ms 10320 KB Output is correct
2 Correct 423 ms 10832 KB Output is correct
3 Correct 414 ms 11552 KB Output is correct
4 Correct 416 ms 10992 KB Output is correct
5 Correct 441 ms 12012 KB Output is correct
6 Correct 391 ms 11140 KB Output is correct
7 Correct 408 ms 11108 KB Output is correct
8 Correct 411 ms 11940 KB Output is correct
9 Correct 440 ms 12108 KB Output is correct
10 Correct 412 ms 11032 KB Output is correct
11 Correct 412 ms 10852 KB Output is correct
12 Correct 404 ms 11588 KB Output is correct
13 Correct 396 ms 11856 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2560 KB Output is correct
2 Correct 7 ms 2572 KB Output is correct
3 Correct 5 ms 2396 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 5 ms 2576 KB Output is correct
6 Correct 5 ms 2396 KB Output is correct
7 Correct 5 ms 2576 KB Output is correct
8 Correct 5 ms 2396 KB Output is correct
9 Correct 5 ms 2396 KB Output is correct
10 Correct 5 ms 2652 KB Output is correct
11 Correct 7 ms 2500 KB Output is correct
12 Correct 5 ms 2396 KB Output is correct
13 Correct 4 ms 2396 KB Output is correct
14 Correct 5 ms 2392 KB Output is correct
15 Correct 4 ms 2396 KB Output is correct
16 Correct 8 ms 2576 KB Output is correct
17 Correct 5 ms 2396 KB Output is correct
18 Correct 4 ms 2572 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 426 ms 10320 KB Output is correct
23 Correct 423 ms 10832 KB Output is correct
24 Correct 414 ms 11552 KB Output is correct
25 Correct 416 ms 10992 KB Output is correct
26 Correct 441 ms 12012 KB Output is correct
27 Correct 391 ms 11140 KB Output is correct
28 Correct 408 ms 11108 KB Output is correct
29 Correct 411 ms 11940 KB Output is correct
30 Correct 440 ms 12108 KB Output is correct
31 Correct 412 ms 11032 KB Output is correct
32 Correct 412 ms 10852 KB Output is correct
33 Correct 404 ms 11588 KB Output is correct
34 Correct 396 ms 11856 KB Output is correct
35 Correct 412 ms 10424 KB Output is correct
36 Correct 417 ms 11856 KB Output is correct
37 Correct 420 ms 12624 KB Output is correct
38 Correct 424 ms 12544 KB Output is correct
39 Correct 424 ms 12952 KB Output is correct
40 Correct 414 ms 12328 KB Output is correct
41 Correct 416 ms 12356 KB Output is correct
42 Correct 425 ms 12368 KB Output is correct
43 Correct 415 ms 11600 KB Output is correct
44 Correct 418 ms 12180 KB Output is correct
45 Correct 417 ms 12116 KB Output is correct
46 Correct 429 ms 13136 KB Output is correct
47 Correct 404 ms 11764 KB Output is correct
48 Correct 395 ms 11604 KB Output is correct
49 Correct 393 ms 10732 KB Output is correct
50 Correct 398 ms 11608 KB Output is correct
51 Correct 405 ms 11944 KB Output is correct
52 Correct 394 ms 11572 KB Output is correct