Submission #65088

# Submission time Handle Problem Language Result Execution time Memory
65088 2018-08-06T15:01:11 Z keko37 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
359 ms 169636 KB
#include<iostream>
#include<cstdio>

using namespace std;

typedef long long llint;

const int MAXN = 200005;

llint n, q, s, t, sol;
llint l[MAXN], fen[MAXN];

void ubaci (int x, int k) {
	for (; x<MAXN; x+=x&-x) fen[x] += k;
}

llint upit (int x) {
	llint res = 0;
	for (; x; x-=x&-x) res += fen[x];
	return res;
}

llint val (llint x, llint y) {
	if (x<y) return (x-y)*s; return (x-y)*t;
}

int main () {
	scanf("%lld%lld%lld%lld", &n, &q, &s, &t);
	for (int i=0; i<=n; i++) {
		scanf("%lld", &l[i]);
		if (!i) continue;
		sol += val(l[i-1], l[i]);
		ubaci(i, l[i]);
		ubaci(i+1, -l[i]);
	}
	for (int i=0; i<q; i++) {
		llint lef, rig, d;
		scanf("%lld%lld%lld", &lef, &rig, &d);
		sol -= val(upit(lef-1), upit(lef));
		if (rig < n) sol -= val(upit(rig), upit(rig+1));
		ubaci(lef, d);
		if (rig < n) ubaci(rig+1, -d);
		sol += val(upit(lef-1), upit(lef));
		if (rig < n) sol += val(upit(rig), upit(rig+1));
		printf("%lld\n", sol);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'llint val(llint, llint)':
foehn_phenomena.cpp:24:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (x<y) return (x-y)*s; return (x-y)*t;
  ^~
foehn_phenomena.cpp:24:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if (x<y) return (x-y)*s; return (x-y)*t;
                           ^~~~~~
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:28:7: 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);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &l[i]);
   ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &lef, &rig, &d);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 7 ms 684 KB Output is correct
3 Correct 7 ms 820 KB Output is correct
4 Correct 6 ms 864 KB Output is correct
5 Correct 6 ms 976 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 4 ms 1072 KB Output is correct
8 Correct 6 ms 1180 KB Output is correct
9 Correct 8 ms 1180 KB Output is correct
10 Correct 6 ms 1180 KB Output is correct
11 Correct 5 ms 1324 KB Output is correct
12 Correct 6 ms 1436 KB Output is correct
13 Correct 4 ms 1620 KB Output is correct
14 Correct 4 ms 1620 KB Output is correct
15 Correct 7 ms 1620 KB Output is correct
16 Correct 6 ms 1636 KB Output is correct
17 Correct 5 ms 1676 KB Output is correct
18 Correct 6 ms 1676 KB Output is correct
19 Correct 4 ms 1676 KB Output is correct
20 Correct 4 ms 1676 KB Output is correct
21 Correct 4 ms 1676 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 319 ms 11452 KB Output is correct
2 Correct 291 ms 17676 KB Output is correct
3 Correct 254 ms 23456 KB Output is correct
4 Correct 280 ms 28472 KB Output is correct
5 Correct 302 ms 35244 KB Output is correct
6 Correct 244 ms 40216 KB Output is correct
7 Correct 201 ms 44864 KB Output is correct
8 Correct 289 ms 50292 KB Output is correct
9 Correct 359 ms 56196 KB Output is correct
10 Correct 285 ms 60468 KB Output is correct
11 Correct 202 ms 65928 KB Output is correct
12 Correct 212 ms 71320 KB Output is correct
13 Correct 223 ms 76188 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 7 ms 684 KB Output is correct
3 Correct 7 ms 820 KB Output is correct
4 Correct 6 ms 864 KB Output is correct
5 Correct 6 ms 976 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 4 ms 1072 KB Output is correct
8 Correct 6 ms 1180 KB Output is correct
9 Correct 8 ms 1180 KB Output is correct
10 Correct 6 ms 1180 KB Output is correct
11 Correct 5 ms 1324 KB Output is correct
12 Correct 6 ms 1436 KB Output is correct
13 Correct 4 ms 1620 KB Output is correct
14 Correct 4 ms 1620 KB Output is correct
15 Correct 7 ms 1620 KB Output is correct
16 Correct 6 ms 1636 KB Output is correct
17 Correct 5 ms 1676 KB Output is correct
18 Correct 6 ms 1676 KB Output is correct
19 Correct 4 ms 1676 KB Output is correct
20 Correct 4 ms 1676 KB Output is correct
21 Correct 4 ms 1676 KB Output is correct
22 Correct 319 ms 11452 KB Output is correct
23 Correct 291 ms 17676 KB Output is correct
24 Correct 254 ms 23456 KB Output is correct
25 Correct 280 ms 28472 KB Output is correct
26 Correct 302 ms 35244 KB Output is correct
27 Correct 244 ms 40216 KB Output is correct
28 Correct 201 ms 44864 KB Output is correct
29 Correct 289 ms 50292 KB Output is correct
30 Correct 359 ms 56196 KB Output is correct
31 Correct 285 ms 60468 KB Output is correct
32 Correct 202 ms 65928 KB Output is correct
33 Correct 212 ms 71320 KB Output is correct
34 Correct 223 ms 76188 KB Output is correct
35 Correct 279 ms 79424 KB Output is correct
36 Correct 331 ms 86276 KB Output is correct
37 Correct 353 ms 92720 KB Output is correct
38 Correct 305 ms 97880 KB Output is correct
39 Correct 309 ms 103252 KB Output is correct
40 Correct 286 ms 108600 KB Output is correct
41 Correct 308 ms 113828 KB Output is correct
42 Correct 320 ms 119300 KB Output is correct
43 Correct 331 ms 123988 KB Output is correct
44 Correct 344 ms 130016 KB Output is correct
45 Correct 288 ms 135308 KB Output is correct
46 Correct 319 ms 142048 KB Output is correct
47 Correct 223 ms 146636 KB Output is correct
48 Correct 236 ms 151300 KB Output is correct
49 Correct 316 ms 154808 KB Output is correct
50 Correct 269 ms 159984 KB Output is correct
51 Correct 249 ms 165076 KB Output is correct
52 Correct 200 ms 169636 KB Output is correct