oj.uz

Submission #69357

# Submission time Handle Problem Language Result Execution time Memory
69357 2018-08-20T15:25:55 Z MrTEK Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 273 ms 168888 KB 
#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left isc+isc
#define right isc+isc+1
#define mid (l+r)/2
#define FAfi_IO ios_base::sync_with_fidio(false);
#define escl '\n'

typedef long long int ll;

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 2e5 + 5;
const int M = 1e4 + 5;
const int SQ = 350;
const int MOD = 998244353;

typedef long long int lli;
typedef pair<int,int> pii;

int n,q,s,t,x[N];
long long ans,y[N];

int main() {

	scanf("%d %d %d %d",&n,&q,&s,&t);

	for (int i = 0 ; i <= n ; i++) scanf("%d",&x[i]);

	for (int i = 1 ; i <= n ; i++) y[i] = x[i] - x[i - 1];

	for (int i = 1 ; i <= n ; i++) ans += y[i] >= 0 ? s * y[i] : t * y[i];

	while (q--) {
		int l,r,k;
		scanf("%d %d %d",&l,&r,&k);
		if (l > 0) {
			ans -= y[l] >= 0 ? s * y[l] : t * y[l];
			y[l] += k;
			ans += y[l] >= 0 ? s * y[l] : t * y[l];
		}
		if (r < n) {
			ans -= y[r + 1] >= 0 ? s * y[r + 1] : t * y[r + 1];
			y[r + 1] -= k;
			ans += y[r + 1] >= 0 ? s * y[r + 1] : t * y[r + 1];			
		}
		printf("%lld\n",-ans);
	}

	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d %d",&n,&q,&s,&t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:39:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0 ; i <= n ; i++) scanf("%d",&x[i]);
                                 ~~~~~^~~~~~~~~~~~
foehn_phenomena.cpp:47:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&l,&r,&k);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 684 KB Output is correct
3 Correct 5 ms 684 KB Output is correct
4 Correct 4 ms 740 KB Output is correct
5 Correct 5 ms 740 KB Output is correct
6 Correct 4 ms 872 KB Output is correct
7 Correct 4 ms 924 KB Output is correct
8 Correct 5 ms 1092 KB Output is correct
9 Correct 4 ms 1100 KB Output is correct
10 Correct 4 ms 1276 KB Output is correct
11 Correct 4 ms 1388 KB Output is correct
12 Correct 4 ms 1388 KB Output is correct
13 Correct 5 ms 1388 KB Output is correct
14 Correct 4 ms 1456 KB Output is correct
15 Correct 5 ms 1524 KB Output is correct
16 Correct 5 ms 1604 KB Output is correct
17 Correct 5 ms 1680 KB Output is correct
18 Correct 5 ms 1680 KB Output is correct
19 Correct 3 ms 1680 KB Output is correct
20 Correct 3 ms 1680 KB Output is correct
21 Correct 3 ms 1680 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 10900 KB Output is correct
2 Correct 222 ms 16964 KB Output is correct
3 Correct 202 ms 22904 KB Output is correct
4 Correct 208 ms 27624 KB Output is correct
5 Correct 215 ms 34464 KB Output is correct
6 Correct 165 ms 39568 KB Output is correct
7 Correct 155 ms 44000 KB Output is correct
8 Correct 243 ms 49540 KB Output is correct
9 Correct 196 ms 55428 KB Output is correct
10 Correct 208 ms 59656 KB Output is correct
11 Correct 129 ms 65108 KB Output is correct
12 Correct 169 ms 70552 KB Output is correct
13 Correct 152 ms 75432 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 684 KB Output is correct
3 Correct 5 ms 684 KB Output is correct
4 Correct 4 ms 740 KB Output is correct
5 Correct 5 ms 740 KB Output is correct
6 Correct 4 ms 872 KB Output is correct
7 Correct 4 ms 924 KB Output is correct
8 Correct 5 ms 1092 KB Output is correct
9 Correct 4 ms 1100 KB Output is correct
10 Correct 4 ms 1276 KB Output is correct
11 Correct 4 ms 1388 KB Output is correct
12 Correct 4 ms 1388 KB Output is correct
13 Correct 5 ms 1388 KB Output is correct
14 Correct 4 ms 1456 KB Output is correct
15 Correct 5 ms 1524 KB Output is correct
16 Correct 5 ms 1604 KB Output is correct
17 Correct 5 ms 1680 KB Output is correct
18 Correct 5 ms 1680 KB Output is correct
19 Correct 3 ms 1680 KB Output is correct
20 Correct 3 ms 1680 KB Output is correct
21 Correct 3 ms 1680 KB Output is correct
22 Correct 211 ms 10900 KB Output is correct
23 Correct 222 ms 16964 KB Output is correct
24 Correct 202 ms 22904 KB Output is correct
25 Correct 208 ms 27624 KB Output is correct
26 Correct 215 ms 34464 KB Output is correct
27 Correct 165 ms 39568 KB Output is correct
28 Correct 155 ms 44000 KB Output is correct
29 Correct 243 ms 49540 KB Output is correct
30 Correct 196 ms 55428 KB Output is correct
31 Correct 208 ms 59656 KB Output is correct
32 Correct 129 ms 65108 KB Output is correct
33 Correct 169 ms 70552 KB Output is correct
34 Correct 152 ms 75432 KB Output is correct
35 Correct 192 ms 78724 KB Output is correct
36 Correct 273 ms 85744 KB Output is correct
37 Correct 205 ms 91728 KB Output is correct
38 Correct 214 ms 96972 KB Output is correct
39 Correct 214 ms 102424 KB Output is correct
40 Correct 227 ms 107836 KB Output is correct
41 Correct 233 ms 113096 KB Output is correct
42 Correct 257 ms 118548 KB Output is correct
43 Correct 231 ms 123380 KB Output is correct
44 Correct 218 ms 129132 KB Output is correct
45 Correct 227 ms 134516 KB Output is correct
46 Correct 205 ms 141192 KB Output is correct
47 Correct 157 ms 145872 KB Output is correct
48 Correct 160 ms 150504 KB Output is correct
49 Correct 183 ms 153992 KB Output is correct
50 Correct 168 ms 159236 KB Output is correct
51 Correct 185 ms 164168 KB Output is correct
52 Correct 146 ms 168888 KB Output is correct