oj.uz

Submission #33269

# Submission time Handle Problem Language Result Execution time Memory
33269 2017-10-23T07:56:32 Z UncleGrandpa925 Foehn Phenomena (JOI17_foehn_phenomena) C++14
40 / 100
 1000 ms 28596 KB 
/*input
2 2 5 5
0 6 -1
1 1 4
1 2 8

3 5 1 2
0 4 1 8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N 200005
#define bit(x,y) ((x>>y)&1LL)
#define show(x) cout << (#x) << ": " << x << endl;
#define ii pair<int,int>
ostream& operator << (ostream &os, vector<int>&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << sp;
	return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
	cout << x.fi << sp << x.se << sp;
	return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << endl;
	return os;
}

int n, q, S, T;
int a[N];
int f[4 * N];
int lazy[4 * N];

class ITrangeSum {
private:
	int f[4 * N];
	int lazy[4 * N];
	void dolazy(int k, int l, int r) {
		if (lazy[k] == 0) return;
		f[k] += lazy[k] * (r - l + 1);
		if (l != r) {
			lazy[k * 2] += lazy[k];
			lazy[k * 2 + 1] += lazy[k];
		}
		lazy[k] = 0;
	}
public:
	void update(int k, int l, int r, int L, int R, int val) {
		dolazy(k, l, r);
		if (r < L || R < l) return;
		if (L <= l && r <= R) {
			f[k] += val * (r - l + 1);
			if (l != r) {
				lazy[k * 2] += val;
				lazy[k * 2 + 1] += val;
			}
			return;
		}
		int mid = (l + r) / 2;
		update(k * 2, l, mid, L, R, val); update(k * 2 + 1, mid + 1, r, L, R, val);
		f[k] = f[k * 2] + f[k * 2 + 1];
	}
	int get(int k, int l, int r, int L, int R) {
		dolazy(k, l, r);
		if (r < L || R < l) return 0;
		if (L <= l && r <= R) return f[k];
		int mid = (l + r) / 2;
		return get(k * 2, l, mid, L, R) + get(k * 2 + 1, mid + 1, r, L, R);
	}
} IT;
#define acc(p) IT.get(1, 1, n, p, p)

int curans = 0;
signed main() {
	scanf("%lld %lld %lld %lld", &n, &q, &S, &T); n++;
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), IT.update(1, 1, n, i, i, a[i]);
	for (int i = 2; i <= n; i++) {
		if (a[i - 1] < a[i]) curans -= S * (a[i] - a[i - 1]);
		else curans += T * abs(a[i - 1] - a[i]);
	}
	for (int i = 1; i <= q; i++) {
		int l, r, val;
		scanf("%lld %lld %lld", &l, &r, &val);
		l++; r++;
		if (l != 1) {
			int x = acc(l - 1); int y = acc(l);
			if (x < y) curans += S * (y - x);
			else curans -= T * (x - y);
		}
		if (r != n) {
			int x = acc(r); int y = acc(r + 1);
			if (x < y) curans += S * (y - x);
			else curans -= T * (x - y);
		}
		IT.update(1, 1, n, l, r, val);
		if (l != 1) {
			int x = acc(l - 1); int y = acc(l);
			if (x < y) curans -= S * (y - x);
			else curans += T * (x - y);
		}
		if (r != n) {
			int x = acc(r); int y = acc(r + 1);
			if (x < y) curans -= S * (y - x);
			else curans += T * (x - y);
		}
		printf("%lld\n", curans);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<long long int>&)':
foehn_phenomena.cpp:48:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << sp;
                    ^
foehn_phenomena.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::pair<long long int, long long int> >&)':
foehn_phenomena.cpp:56:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << endl;
                    ^
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:106:46: 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); n++;
                                              ^
foehn_phenomena.cpp:107:83: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), IT.update(1, 1, n, i, i, a[i]);
                                                                                   ^
foehn_phenomena.cpp:114:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld", &l, &r, &val);
                                        ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 973 ms 28596 KB Output is correct
2 Correct 903 ms 28596 KB Output is correct
3 Correct 869 ms 28596 KB Output is correct
4 Correct 863 ms 28596 KB Output is correct
5 Correct 836 ms 28596 KB Output is correct
6 Correct 376 ms 28596 KB Output is correct
7 Correct 379 ms 28596 KB Output is correct
8 Correct 709 ms 28596 KB Output is correct
9 Correct 703 ms 28596 KB Output is correct
10 Correct 749 ms 28596 KB Output is correct
11 Correct 486 ms 28596 KB Output is correct
12 Correct 389 ms 28596 KB Output is correct
13 Correct 363 ms 28596 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 28596 KB Output is correct
2 Correct 6 ms 28596 KB Output is correct
3 Correct 6 ms 28596 KB Output is correct
4 Correct 6 ms 28596 KB Output is correct
5 Correct 3 ms 28596 KB Output is correct
6 Correct 6 ms 28596 KB Output is correct
7 Correct 6 ms 28596 KB Output is correct
8 Correct 6 ms 28596 KB Output is correct
9 Correct 6 ms 28596 KB Output is correct
10 Correct 3 ms 28596 KB Output is correct
11 Correct 0 ms 28596 KB Output is correct
12 Correct 3 ms 28596 KB Output is correct
13 Correct 3 ms 28596 KB Output is correct
14 Correct 3 ms 28596 KB Output is correct
15 Correct 6 ms 28596 KB Output is correct
16 Correct 3 ms 28596 KB Output is correct
17 Correct 3 ms 28596 KB Output is correct
18 Correct 3 ms 28596 KB Output is correct
19 Correct 0 ms 28596 KB Output is correct
20 Correct 0 ms 28596 KB Output is correct
21 Correct 0 ms 28596 KB Output is correct
22 Correct 973 ms 28596 KB Output is correct
23 Correct 903 ms 28596 KB Output is correct
24 Correct 869 ms 28596 KB Output is correct
25 Correct 863 ms 28596 KB Output is correct
26 Correct 836 ms 28596 KB Output is correct
27 Correct 376 ms 28596 KB Output is correct
28 Correct 379 ms 28596 KB Output is correct
29 Correct 709 ms 28596 KB Output is correct
30 Correct 703 ms 28596 KB Output is correct
31 Correct 749 ms 28596 KB Output is correct
32 Correct 486 ms 28596 KB Output is correct
33 Correct 389 ms 28596 KB Output is correct
34 Correct 363 ms 28596 KB Output is correct
35 Correct 909 ms 28596 KB Output is correct
36 Correct 919 ms 28596 KB Output is correct
37 Correct 936 ms 28596 KB Output is correct
38 Correct 909 ms 28596 KB Output is correct
39 Correct 856 ms 28596 KB Output is correct
40 Correct 973 ms 28596 KB Output is correct
41 Execution timed out 1000 ms 28596 KB Execution timed out
42 Halted 0 ms 0 KB -