oj.uz

Submission #166841

# Submission time Handle Problem Language Result Execution time Memory
166841 2019-12-04T09:23:10 Z anubhavdhar Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 691 ms 11768 KB 
#include<bits/stdc++.h>

#define ll long long int 
#define FOR(i,N) for(i=0;i<N;i++)
#define FORe(i,N) for(i=1;i<=N;i++)
#define FORr(i,a,b) for(i=a;i<b;i++)
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define vi vector<ll>
#define ii pair<ll,ll>
#define vii vector<ii>

const ll MAXN = 1e5;
const ll LOGN = 17;
const ll ROOTN = 320;
const ll INF = 1e17+21;
const ll MOD = 1e9 + 7;

using namespace std;

ll N,Q,S,T,i,L,R,x,temp = 0;

inline ll TEMPERATURE(ll a)
{
	return ((a < 0)? (- T*a) : (- S*a));
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
    ll prev = 0;
	cin>>N>>Q>>S>>T;
	N++;
	ll A[N];
	FOR(i,N)
	{
		cin>>x;
		A[i] = x - prev;
		prev = x;
		temp += TEMPERATURE(A[i]);//(A[i] < 0) ? (A[i]*T) : (A[i]*S);
	}
	//cout<<"temp now = "<<temp<<endl;
	//FOR(i,N)
	//	cout<<A[i]<<" ";
	//cout<<endl;
	while (Q--)
	{
		cin>>L>>R>>x;
		A[L] += x;
		temp += TEMPERATURE(A[L]) - TEMPERATURE(A[L] - x);
		//cout<<"due to L = "<<L<<"we do temp+="<< TEMPERATURE(A[L]) <<" - "<< TEMPERATURE(A[L] - x)<<"; so temp = "<<temp<<endl;
		if (R<N-1)
		{
			A[R+1] -= x;
			temp += TEMPERATURE(A[R+1]) - TEMPERATURE(A[R+1] + x);
			//cout<<"due to R = "<<L<<"we do temp+="<< TEMPERATURE(A[R+1]) <<" - "<< TEMPERATURE(A[R+1] + x)<<"; so temp = "<<temp<<endl;
		}
		//FOR(i,N)
			//cout<<A[i]<<" ";
		//cout<<endl;
		cout<<temp<<endl;
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 9 ms 504 KB Output is correct
6 Correct 9 ms 376 KB Output is correct
7 Correct 9 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 504 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 8 ms 504 KB Output is correct
16 Correct 8 ms 504 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 376 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 660 ms 8952 KB Output is correct
2 Correct 664 ms 9480 KB Output is correct
3 Correct 664 ms 10116 KB Output is correct
4 Correct 665 ms 9592 KB Output is correct
5 Correct 672 ms 10712 KB Output is correct
6 Correct 632 ms 9592 KB Output is correct
7 Correct 642 ms 9436 KB Output is correct
8 Correct 675 ms 10420 KB Output is correct
9 Correct 668 ms 10984 KB Output is correct
10 Correct 656 ms 9592 KB Output is correct
11 Correct 624 ms 9548 KB Output is correct
12 Correct 625 ms 10344 KB Output is correct
13 Correct 625 ms 10572 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 9 ms 504 KB Output is correct
6 Correct 9 ms 376 KB Output is correct
7 Correct 9 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 9 ms 376 KB Output is correct
11 Correct 9 ms 504 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 8 ms 504 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Correct 8 ms 504 KB Output is correct
16 Correct 8 ms 504 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 376 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 660 ms 8952 KB Output is correct
23 Correct 664 ms 9480 KB Output is correct
24 Correct 664 ms 10116 KB Output is correct
25 Correct 665 ms 9592 KB Output is correct
26 Correct 672 ms 10712 KB Output is correct
27 Correct 632 ms 9592 KB Output is correct
28 Correct 642 ms 9436 KB Output is correct
29 Correct 675 ms 10420 KB Output is correct
30 Correct 668 ms 10984 KB Output is correct
31 Correct 656 ms 9592 KB Output is correct
32 Correct 624 ms 9548 KB Output is correct
33 Correct 625 ms 10344 KB Output is correct
34 Correct 625 ms 10572 KB Output is correct
35 Correct 675 ms 8972 KB Output is correct
36 Correct 685 ms 10472 KB Output is correct
37 Correct 687 ms 11384 KB Output is correct
38 Correct 684 ms 10928 KB Output is correct
39 Correct 676 ms 11128 KB Output is correct
40 Correct 680 ms 11000 KB Output is correct
41 Correct 677 ms 11000 KB Output is correct
42 Correct 682 ms 11064 KB Output is correct
43 Correct 691 ms 10104 KB Output is correct
44 Correct 687 ms 10744 KB Output is correct
45 Correct 672 ms 10616 KB Output is correct
46 Correct 683 ms 11768 KB Output is correct
47 Correct 636 ms 10476 KB Output is correct
48 Correct 639 ms 10288 KB Output is correct
49 Correct 686 ms 9304 KB Output is correct
50 Correct 632 ms 10240 KB Output is correct
51 Correct 663 ms 10488 KB Output is correct
52 Correct 654 ms 10232 KB Output is correct