oj.uz

Submission #292173

# Submission time Handle Problem Language Result Execution time Memory
292173 2020-09-06T13:21:53 Z Namnamseo Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 249 ms 13176 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back

int n, q, s, t;

ll alt[200010];

ll tree[200010];
ll S(int p){
	ll ret=0;
	while(p) ret+=tree[p], p&=(p-1);
	return ret;
}

void u(int p, ll v){ while(p<=200000) tree[p]+=v, p+=(p&(-p)); }

ll T=0;
void up(int p, int sg){
	if(p<1 || n<p) return;
	if(S(p)>S(p-1)) T-=sg*s*ll(S(p)-S(p-1));
	else T-=sg*t*ll(S(p)-S(p-1));
}

int main()
{
    read(n, q, s, t);
    read(alt[0]);
    for(int i=1; i<=n; ++i){
		read(alt[i]);
		if(alt[i-1]<alt[i]) T-=s*ll(alt[i]-alt[i-1]);
		else T-=t*ll(alt[i]-alt[i-1]);
		u(i, alt[i]-alt[i-1]);
    }
    for(int i=1; i<=q; ++i){
		int l, r;
		ll x;
		read(l, r, x);
		up(l, -1);
		up(r+1, -1);
		
		u(l, x);
		u(r+1, -x);
		
		up(l, 1);
		up(r+1, 1);
		printf("%lld\n", T);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void read(int&)':
foehn_phenomena.cpp:5:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    5 | void read(int& x){ scanf("%d",&x); }
      |                    ~~~~~^~~~~~~~~
foehn_phenomena.cpp: In function 'void read(ll&)':
foehn_phenomena.cpp:6:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    6 | void read(ll& x){ scanf("%lld",&x); }
      |                   ~~~~~^~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 10360 KB Output is correct
2 Correct 242 ms 11020 KB Output is correct
3 Correct 239 ms 11464 KB Output is correct
4 Correct 227 ms 10872 KB Output is correct
5 Correct 229 ms 12088 KB Output is correct
6 Correct 174 ms 11036 KB Output is correct
7 Correct 168 ms 11000 KB Output is correct
8 Correct 227 ms 11896 KB Output is correct
9 Correct 225 ms 12120 KB Output is correct
10 Correct 222 ms 10888 KB Output is correct
11 Correct 163 ms 11000 KB Output is correct
12 Correct 165 ms 11640 KB Output is correct
13 Correct 163 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 4 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 239 ms 10360 KB Output is correct
23 Correct 242 ms 11020 KB Output is correct
24 Correct 239 ms 11464 KB Output is correct
25 Correct 227 ms 10872 KB Output is correct
26 Correct 229 ms 12088 KB Output is correct
27 Correct 174 ms 11036 KB Output is correct
28 Correct 168 ms 11000 KB Output is correct
29 Correct 227 ms 11896 KB Output is correct
30 Correct 225 ms 12120 KB Output is correct
31 Correct 222 ms 10888 KB Output is correct
32 Correct 163 ms 11000 KB Output is correct
33 Correct 165 ms 11640 KB Output is correct
34 Correct 163 ms 11896 KB Output is correct
35 Correct 235 ms 10488 KB Output is correct
36 Correct 240 ms 11816 KB Output is correct
37 Correct 249 ms 12792 KB Output is correct
38 Correct 240 ms 12404 KB Output is correct
39 Correct 242 ms 12452 KB Output is correct
40 Correct 241 ms 12408 KB Output is correct
41 Correct 246 ms 12352 KB Output is correct
42 Correct 238 ms 12400 KB Output is correct
43 Correct 238 ms 11768 KB Output is correct
44 Correct 237 ms 12024 KB Output is correct
45 Correct 230 ms 12152 KB Output is correct
46 Correct 235 ms 13176 KB Output is correct
47 Correct 195 ms 11640 KB Output is correct
48 Correct 188 ms 11756 KB Output is correct
49 Correct 220 ms 10748 KB Output is correct
50 Correct 168 ms 11516 KB Output is correct
51 Correct 164 ms 11896 KB Output is correct
52 Correct 179 ms 11644 KB Output is correct