oj.uz

답안 #46640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46640 2018-04-22T12:30:23 Z maksim_gaponov Foehn Phenomena (JOI17_foehn_phenomena) C++14
40 / 100
 1000 ms 5932 KB 
#define _CRT_SECURE_NO_WARNINGS
#ifdef _DEBUG
#define FILE_IN "input.txt"
#define FILE_OUT "output.txt"
#endif
#include <iostream>
#include <cstdlib>
#include <climits>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;

void openFiles() {
#ifdef _DEBUG
	assert(freopen(FILE_IN, "r", stdin));
	assert(freopen(FILE_OUT, "w", stdout));
#endif
}

vector<ll> a;

int main() {
	openFiles();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, q, s, t;
	cin >> n >> q >> s >> t;
	bool hack = (s == t);
	n++;
	a.resize(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int j = 0; j < q; j++) {
		int l, r;
		ll x;
		cin >> l >> r >> x;
		ll res = 0;
		if (hack) {
			if (r == n - 1) {
				a[r] += x;
			}
			res = (a[n - 1] - a[0]) * -s;
		}
		else {
			for (int i = l; i <= r; i++) {
				a[i] += x;
			}
			for (int i = 1; i < n; i++) {
				ll diff = abs(a[i] - a[i - 1]);
				if (a[i] > a[i - 1]) {
					res -= s * diff;
				}
				else {
					res += t * diff;
				}
			}
		}
		cout << res << "\n";
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 13 ms 488 KB Output is correct
3 Correct 14 ms 488 KB Output is correct
4 Correct 14 ms 500 KB Output is correct
5 Correct 13 ms 564 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 14 ms 656 KB Output is correct
8 Correct 14 ms 656 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 14 ms 676 KB Output is correct
11 Correct 3 ms 676 KB Output is correct
12 Correct 16 ms 676 KB Output is correct
13 Correct 15 ms 676 KB Output is correct
14 Correct 12 ms 676 KB Output is correct
15 Correct 12 ms 676 KB Output is correct
16 Correct 11 ms 676 KB Output is correct
17 Correct 16 ms 676 KB Output is correct
18 Correct 15 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 788 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 169 ms 3692 KB Output is correct
2 Correct 124 ms 4268 KB Output is correct
3 Correct 120 ms 4744 KB Output is correct
4 Correct 131 ms 4744 KB Output is correct
5 Correct 123 ms 4872 KB Output is correct
6 Correct 119 ms 5164 KB Output is correct
7 Correct 110 ms 5164 KB Output is correct
8 Correct 121 ms 5164 KB Output is correct
9 Correct 131 ms 5420 KB Output is correct
10 Correct 133 ms 5420 KB Output is correct
11 Correct 107 ms 5420 KB Output is correct
12 Correct 121 ms 5548 KB Output is correct
13 Correct 113 ms 5932 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 13 ms 488 KB Output is correct
3 Correct 14 ms 488 KB Output is correct
4 Correct 14 ms 500 KB Output is correct
5 Correct 13 ms 564 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 14 ms 656 KB Output is correct
8 Correct 14 ms 656 KB Output is correct
9 Correct 3 ms 676 KB Output is correct
10 Correct 14 ms 676 KB Output is correct
11 Correct 3 ms 676 KB Output is correct
12 Correct 16 ms 676 KB Output is correct
13 Correct 15 ms 676 KB Output is correct
14 Correct 12 ms 676 KB Output is correct
15 Correct 12 ms 676 KB Output is correct
16 Correct 11 ms 676 KB Output is correct
17 Correct 16 ms 676 KB Output is correct
18 Correct 15 ms 676 KB Output is correct
19 Correct 2 ms 676 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 2 ms 788 KB Output is correct
22 Correct 169 ms 3692 KB Output is correct
23 Correct 124 ms 4268 KB Output is correct
24 Correct 120 ms 4744 KB Output is correct
25 Correct 131 ms 4744 KB Output is correct
26 Correct 123 ms 4872 KB Output is correct
27 Correct 119 ms 5164 KB Output is correct
28 Correct 110 ms 5164 KB Output is correct
29 Correct 121 ms 5164 KB Output is correct
30 Correct 131 ms 5420 KB Output is correct
31 Correct 133 ms 5420 KB Output is correct
32 Correct 107 ms 5420 KB Output is correct
33 Correct 121 ms 5548 KB Output is correct
34 Correct 113 ms 5932 KB Output is correct
35 Correct 132 ms 5932 KB Output is correct
36 Execution timed out 1082 ms 5932 KB Time limit exceeded
37 Halted 0 ms 0 KB -