oj.uz

Submission #227934

# Submission time Handle Problem Language Result Execution time Memory
227934 2020-04-29T09:22:00 Z dvdg6566 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 869 ms 11896 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#define SZ(x) (ll)x.size()
#define f first
#define s second
const ll MAXN = 301000;
const ll INF = 1e18;
const ll MOD = 1e9+7;

ll N,M,a,b,A,B;
ll fw[MAXN];
ll ans;

void up(ll x, ll y, ll v){
	--x;
	for(;y;y-=y&(-y))fw[y]+=v;
	for(;x;x-=x&(-x))fw[x]-=v;
}

ll query(ll x){
	if(x==0)return 0;
	ll res=0;
	for(;x<=N;x+=x&(-x))res+=fw[x];
	return res;
}

ll ask(ll a, ll b){
	// cerr<<a<<' '<<b<<'\n';
	if(a<b)return A*(a-b);
	else return B*(a-b);
}

int main(){
	cin>>N>>M>>A>>B;
	cin>>a;
	// cerr<<ask(4,8)<<'\n';
	for (ll i=1;i<=N;++i){
		cin>>a;
		ans+=ask(b,a);
		up(i,i,a);
		b=a;
	}
	// cout<<ans<<'\n';
	// return 0;
	for (ll i=0;i<M;++i){
		ll a,b,c,d,h;
		cin>>a>>b>>h;
		ans-=ask(query(a-1),query(a));
		// cerr<<(b==N)<<' '<<query(b)<<' '<<query(b+1)<<'\n';
		if(b!=N)ans-=ask(query(b),query(b+1));
		// cerr<<"I "<<ans<<'\n';
		up(a,b,h);
		ans+=ask(query(a-1),query(a));
		if(b!=N)ans+=ask(query(b),query(b+1));
		cout<<ans<<'\n';
		// for(ll i=1;i<=N;++i)cout<<query(i)<<' ';cout<<'\n';
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:56:10: warning: unused variable 'c' [-Wunused-variable]
   ll a,b,c,d,h;
          ^
foehn_phenomena.cpp:56:12: warning: unused variable 'd' [-Wunused-variable]
   ll a,b,c,d,h;
            ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 860 ms 8728 KB Output is correct
2 Correct 822 ms 9436 KB Output is correct
3 Correct 843 ms 10232 KB Output is correct
4 Correct 847 ms 9516 KB Output is correct
5 Correct 861 ms 10616 KB Output is correct
6 Correct 767 ms 9592 KB Output is correct
7 Correct 759 ms 9496 KB Output is correct
8 Correct 843 ms 10488 KB Output is correct
9 Correct 827 ms 10744 KB Output is correct
10 Correct 830 ms 9464 KB Output is correct
11 Correct 769 ms 9592 KB Output is correct
12 Correct 780 ms 10360 KB Output is correct
13 Correct 769 ms 10624 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 13 ms 384 KB Output is correct
7 Correct 13 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 12 ms 384 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 14 ms 384 KB Output is correct
13 Correct 12 ms 464 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 12 ms 384 KB Output is correct
16 Correct 12 ms 384 KB Output is correct
17 Correct 15 ms 384 KB Output is correct
18 Correct 12 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 860 ms 8728 KB Output is correct
23 Correct 822 ms 9436 KB Output is correct
24 Correct 843 ms 10232 KB Output is correct
25 Correct 847 ms 9516 KB Output is correct
26 Correct 861 ms 10616 KB Output is correct
27 Correct 767 ms 9592 KB Output is correct
28 Correct 759 ms 9496 KB Output is correct
29 Correct 843 ms 10488 KB Output is correct
30 Correct 827 ms 10744 KB Output is correct
31 Correct 830 ms 9464 KB Output is correct
32 Correct 769 ms 9592 KB Output is correct
33 Correct 780 ms 10360 KB Output is correct
34 Correct 769 ms 10624 KB Output is correct
35 Correct 859 ms 9032 KB Output is correct
36 Correct 844 ms 10488 KB Output is correct
37 Correct 853 ms 11292 KB Output is correct
38 Correct 844 ms 11128 KB Output is correct
39 Correct 829 ms 11128 KB Output is correct
40 Correct 839 ms 11128 KB Output is correct
41 Correct 847 ms 10872 KB Output is correct
42 Correct 869 ms 10928 KB Output is correct
43 Correct 851 ms 10440 KB Output is correct
44 Correct 849 ms 10596 KB Output is correct
45 Correct 847 ms 10744 KB Output is correct
46 Correct 860 ms 11896 KB Output is correct
47 Correct 736 ms 10360 KB Output is correct
48 Correct 759 ms 10388 KB Output is correct
49 Correct 792 ms 9208 KB Output is correct
50 Correct 764 ms 10232 KB Output is correct
51 Correct 788 ms 10360 KB Output is correct
52 Correct 774 ms 10360 KB Output is correct