oj.uz

Submission #173417

# Submission time Handle Problem Language Result Execution time Memory
173417 2020-01-04T04:55:15 Z dennisstar Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 683 ms 18596 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ryan bear
#define all(V) ((V).begin()), ((V).end())
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef vector<int> vim;
typedef vector<ll> vlm;

int N, Q; ll S, T;
ll A[1000010];
int L, R; ll X, now;

struct dt {
	ll ar[(1<<22)], lz[(1<<22)];
	void init() { for (int i=0; i<=N; i++) upd(i, i, A[i]); }
	ll get(int t, int s, int e, int i) {
		spread(i);
		if (s==e) return ar[i];
		int md=(s+e)/2;
		if (t<=md) return get(t, s, md, i*2);
		else return get(t, md+1, e, i*2+1);
	}
	void upd(int is, int ie, int s, int e, int i, ll val) {
		if (s>e) return ;
		if (is<=s&&e<=ie) { lz[i]+=val; return ; }
		int md=(s+e)/2;
		if (is<=md) upd(is, ie, s, md, i*2, val);
		if (md+1<=ie) upd(is, ie, md+1, e, i*2+1, val);
	}
	void spread(int i) {
		if (i<(1<<21)) lz[i*2]+=lz[i], lz[i*2+1]+=lz[i];
		ar[i]+=lz[i]; lz[i]=0;
	}
	void upd(int is, int ie, ll val) { upd(is, ie, 0, N, 1, val); }
	ll get(int t) { return get(t, 0, N, 1); }
}DS;

ll f(ll a, ll b) { return (a-b)*(a<b?S:T); }

int main() {
	scanf("%d %d %lld %lld", &N, &Q, &S, &T);
	for (int i=0; i<=N; i++) scanf("%lld", &A[i]);
	for (int i=1; i<=N; i++) now+=f(A[i-1], A[i]);
	DS.init();
	for (int i=0; i<Q; i++) {
		scanf("%d %d %lld", &L, &R, &X);
		
		now-=f(DS.get(L-1), DS.get(L));
		if (R!=N) now-=f(DS.get(R), DS.get(R+1));

		DS.upd(L, R, X);

		now+=f(DS.get(L-1), DS.get(L));
		if (R!=N) now+=f(DS.get(R), DS.get(R+1));

		printf("%lld\n", now);
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %lld %lld", &N, &Q, &S, &T);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:47:32: 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("%lld", &A[i]);
                           ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %lld", &L, &R, &X);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 630 ms 16120 KB Output is correct
2 Correct 637 ms 16640 KB Output is correct
3 Correct 634 ms 17144 KB Output is correct
4 Correct 625 ms 16372 KB Output is correct
5 Correct 629 ms 17272 KB Output is correct
6 Correct 399 ms 8440 KB Output is correct
7 Correct 399 ms 8312 KB Output is correct
8 Correct 538 ms 17644 KB Output is correct
9 Correct 534 ms 17784 KB Output is correct
10 Correct 530 ms 16632 KB Output is correct
11 Correct 366 ms 8380 KB Output is correct
12 Correct 397 ms 8696 KB Output is correct
13 Correct 390 ms 9148 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 476 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 552 KB Output is correct
13 Correct 4 ms 508 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 630 ms 16120 KB Output is correct
23 Correct 637 ms 16640 KB Output is correct
24 Correct 634 ms 17144 KB Output is correct
25 Correct 625 ms 16372 KB Output is correct
26 Correct 629 ms 17272 KB Output is correct
27 Correct 399 ms 8440 KB Output is correct
28 Correct 399 ms 8312 KB Output is correct
29 Correct 538 ms 17644 KB Output is correct
30 Correct 534 ms 17784 KB Output is correct
31 Correct 530 ms 16632 KB Output is correct
32 Correct 366 ms 8380 KB Output is correct
33 Correct 397 ms 8696 KB Output is correct
34 Correct 390 ms 9148 KB Output is correct
35 Correct 654 ms 16200 KB Output is correct
36 Correct 652 ms 17528 KB Output is correct
37 Correct 665 ms 18596 KB Output is correct
38 Correct 643 ms 18300 KB Output is correct
39 Correct 644 ms 18172 KB Output is correct
40 Correct 683 ms 18284 KB Output is correct
41 Correct 641 ms 18044 KB Output is correct
42 Correct 650 ms 18088 KB Output is correct
43 Correct 636 ms 17400 KB Output is correct
44 Correct 646 ms 17844 KB Output is correct
45 Correct 632 ms 17640 KB Output is correct
46 Correct 633 ms 18264 KB Output is correct
47 Correct 405 ms 9000 KB Output is correct
48 Correct 334 ms 9080 KB Output is correct
49 Correct 651 ms 17328 KB Output is correct
50 Correct 372 ms 9000 KB Output is correct
51 Correct 394 ms 8952 KB Output is correct
52 Correct 644 ms 8972 KB Output is correct