oj.uz

답안 #946957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946957 2024-03-15T08:29:37 Z mariamp1 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 310 ms 13144 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
 
const int maxn = 2e5+10;
 
ll n, q, a[maxn];
ll sum, dif[maxn], s, t;
 
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
 
	cin >> n >> q >> s >> t;
 
	for(int i = 0 ; i <= n ; i++) cin >> a[i];	
 
	for(int i = 1 ; i <= n ; i++)
	{
		dif[i] = a[i]-a[i-1];
		if(dif[i] <= 0) sum += abs(dif[i]*t);
		else sum -= abs(dif[i]*s);
	}
 
	//cout << sum << endl;
 
	dif[0] = dif[n+1] = 0;
 
	//for(int i = 1 ; i <= n ; i++) cout << dif[i] << ' ';
	//cout << endl;
 
	for(int i = 0 ; i < q ; i++)
	{
		int l, r, x;
		cin >> l >> r >> x;
 
		//cout << dif[l] << ' ' << dif[r+1] << endl; 
 
		if(dif[l] <= 0) sum -= abs(dif[l]*t);
		else sum += abs(dif[l]*s);
 
		if(dif[r+1] <= 0) sum -= abs(dif[r+1]*t);
		else sum += abs(dif[r+1]*s);
 
		dif[l] += x;
		if(r+1 <= n) dif[r+1] -= x;
 
		if(dif[l] <= 0) sum += abs(dif[l]*t);
		else sum -= abs(dif[l]*s);
 
		if(dif[r+1] <= 0) sum += abs(dif[r+1]*t);
		else sum -= abs(dif[r+1]*s);		
	
		//cout << dif[l] << ' ' << dif[r+1] << endl; 
 
		cout << sum << endl;
	
	//	for(int i = 1 ; i <= n ; i++) cout << dif[i] << ' ';
//	cout << endl;
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 304 ms 4888 KB Output is correct
2 Correct 287 ms 5608 KB Output is correct
3 Correct 292 ms 6420 KB Output is correct
4 Correct 285 ms 10776 KB Output is correct
5 Correct 293 ms 12116 KB Output is correct
6 Correct 281 ms 11092 KB Output is correct
7 Correct 291 ms 11060 KB Output is correct
8 Correct 287 ms 11976 KB Output is correct
9 Correct 298 ms 12436 KB Output is correct
10 Correct 289 ms 10876 KB Output is correct
11 Correct 293 ms 11060 KB Output is correct
12 Correct 285 ms 11576 KB Output is correct
13 Correct 287 ms 11920 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2392 KB Output is correct
2 Correct 4 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 4 ms 2596 KB Output is correct
5 Correct 3 ms 2520 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 4 ms 2396 KB Output is correct
8 Correct 3 ms 2528 KB Output is correct
9 Correct 3 ms 2396 KB Output is correct
10 Correct 4 ms 2392 KB Output is correct
11 Correct 5 ms 2396 KB Output is correct
12 Correct 4 ms 2532 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 4 ms 2580 KB Output is correct
15 Correct 3 ms 2392 KB Output is correct
16 Correct 3 ms 2396 KB Output is correct
17 Correct 4 ms 2396 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 304 ms 4888 KB Output is correct
23 Correct 287 ms 5608 KB Output is correct
24 Correct 292 ms 6420 KB Output is correct
25 Correct 285 ms 10776 KB Output is correct
26 Correct 293 ms 12116 KB Output is correct
27 Correct 281 ms 11092 KB Output is correct
28 Correct 291 ms 11060 KB Output is correct
29 Correct 287 ms 11976 KB Output is correct
30 Correct 298 ms 12436 KB Output is correct
31 Correct 289 ms 10876 KB Output is correct
32 Correct 293 ms 11060 KB Output is correct
33 Correct 285 ms 11576 KB Output is correct
34 Correct 287 ms 11920 KB Output is correct
35 Correct 284 ms 10356 KB Output is correct
36 Correct 299 ms 12136 KB Output is correct
37 Correct 297 ms 12772 KB Output is correct
38 Correct 295 ms 12588 KB Output is correct
39 Correct 310 ms 12376 KB Output is correct
40 Correct 286 ms 12368 KB Output is correct
41 Correct 288 ms 12312 KB Output is correct
42 Correct 294 ms 12372 KB Output is correct
43 Correct 289 ms 11708 KB Output is correct
44 Correct 282 ms 12132 KB Output is correct
45 Correct 284 ms 12180 KB Output is correct
46 Correct 308 ms 13144 KB Output is correct
47 Correct 285 ms 11776 KB Output is correct
48 Correct 285 ms 11596 KB Output is correct
49 Correct 277 ms 10832 KB Output is correct
50 Correct 303 ms 11600 KB Output is correct
51 Correct 282 ms 11860 KB Output is correct
52 Correct 279 ms 11572 KB Output is correct