oj.uz

Submission #46637

# Submission time Handle Problem Language Result Execution time Memory
46637 2018-04-22T12:24:06 Z maksim_gaponov Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 1000 ms 2292 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;
	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;
		for (int i = l; i <= r; i++) {
			a[i] += x;
		}
		ll res = 0;
		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

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 2292 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 376 KB Output is correct
2 Correct 14 ms 376 KB Output is correct
3 Correct 14 ms 552 KB Output is correct
4 Correct 14 ms 552 KB Output is correct
5 Correct 13 ms 716 KB Output is correct
6 Correct 13 ms 716 KB Output is correct
7 Correct 12 ms 716 KB Output is correct
8 Correct 12 ms 716 KB Output is correct
9 Correct 16 ms 716 KB Output is correct
10 Correct 14 ms 716 KB Output is correct
11 Correct 12 ms 716 KB Output is correct
12 Correct 12 ms 716 KB Output is correct
13 Correct 14 ms 716 KB Output is correct
14 Correct 11 ms 716 KB Output is correct
15 Correct 12 ms 716 KB Output is correct
16 Correct 11 ms 716 KB Output is correct
17 Correct 14 ms 716 KB Output is correct
18 Correct 13 ms 760 KB Output is correct
19 Correct 2 ms 760 KB Output is correct
20 Correct 2 ms 760 KB Output is correct
21 Correct 2 ms 760 KB Output is correct
22 Execution timed out 1075 ms 2292 KB Time limit exceeded
23 Halted 0 ms 0 KB -