oj.uz

Submission #548490

# Submission time Handle Problem Language Result Execution time Memory
548490 2022-04-13T14:35:26 Z Um_nik Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 135 ms 11500 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;

#ifdef LOCAL
	#define eprintf(...) fprintf(stderr, __VA_ARGS__);fflush(stderr);
#else
	#define eprintf(...) 42
#endif

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
template<typename T>
using pair2 = pair<T, T>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
	return (ull)rng() % B;
}

#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second

clock_t startTime;
double getCurrentTime() {
	return (double)(clock() - startTime) / CLOCKS_PER_SEC;
}

const int N = (int)1e6 + 5;
int n, q;
ll s, t;
ll a[N];
ll ans;

ll getVal(ll x) {
	if (x >= 0) return -x * s;
	return -x * t;
}

int main()
{
	startTime = clock();
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

	scanf("%d%d%lld%lld", &n, &q, &s, &t);
	ll lst = 0;
	scanf("%lld", &lst);
	for (int i = 0; i < n; i++) {
		ll x;
		scanf("%lld", &x);
		a[i] = x - lst;
		ans += getVal(a[i]);
		lst = x;
	}
	while(q--) {
		int l, r;
		ll x;
		scanf("%d%d%lld", &l, &r, &x);
		l--;
		ans -= getVal(a[l]);
		a[l] += x;
		ans += getVal(a[l]);
		if (r < n) {
			ans -= getVal(a[r]);
			a[r] -= x;
			ans += getVal(a[r]);
		}
		printf("%lld\n", ans);
	}

	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |  scanf("%d%d%lld%lld", &n, &q, &s, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |  scanf("%lld", &lst);
      |  ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |   scanf("%lld", &x);
      |   ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |   scanf("%d%d%lld", &l, &r, &x);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8736 KB Output is correct
2 Correct 122 ms 9240 KB Output is correct
3 Correct 119 ms 9836 KB Output is correct
4 Correct 110 ms 9292 KB Output is correct
5 Correct 123 ms 10432 KB Output is correct
6 Correct 102 ms 9500 KB Output is correct
7 Correct 100 ms 9380 KB Output is correct
8 Correct 122 ms 10196 KB Output is correct
9 Correct 118 ms 10572 KB Output is correct
10 Correct 123 ms 9292 KB Output is correct
11 Correct 97 ms 9360 KB Output is correct
12 Correct 99 ms 10036 KB Output is correct
13 Correct 101 ms 10268 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 324 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 112 ms 8736 KB Output is correct
23 Correct 122 ms 9240 KB Output is correct
24 Correct 119 ms 9836 KB Output is correct
25 Correct 110 ms 9292 KB Output is correct
26 Correct 123 ms 10432 KB Output is correct
27 Correct 102 ms 9500 KB Output is correct
28 Correct 100 ms 9380 KB Output is correct
29 Correct 122 ms 10196 KB Output is correct
30 Correct 118 ms 10572 KB Output is correct
31 Correct 123 ms 9292 KB Output is correct
32 Correct 97 ms 9360 KB Output is correct
33 Correct 99 ms 10036 KB Output is correct
34 Correct 101 ms 10268 KB Output is correct
35 Correct 117 ms 8860 KB Output is correct
36 Correct 126 ms 10240 KB Output is correct
37 Correct 122 ms 11048 KB Output is correct
38 Correct 119 ms 10832 KB Output is correct
39 Correct 124 ms 10836 KB Output is correct
40 Correct 115 ms 10784 KB Output is correct
41 Correct 117 ms 10616 KB Output is correct
42 Correct 132 ms 10764 KB Output is correct
43 Correct 115 ms 9972 KB Output is correct
44 Correct 135 ms 10376 KB Output is correct
45 Correct 113 ms 10508 KB Output is correct
46 Correct 123 ms 11500 KB Output is correct
47 Correct 105 ms 10096 KB Output is correct
48 Correct 102 ms 10012 KB Output is correct
49 Correct 111 ms 9104 KB Output is correct
50 Correct 106 ms 9888 KB Output is correct
51 Correct 107 ms 10240 KB Output is correct
52 Correct 102 ms 10080 KB Output is correct