oj.uz

Submission #224997

# Submission time Handle Problem Language Result Execution time Memory
224997 2020-04-19T07:50:15 Z bharat2002 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 561 ms 13208 KB 
/*input
3 0 1 2
0
6
3
8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
*/
#include<bits/stdc++.h>
using namespace std;
const int N=2e5 + 100;
const int mod=1e9 + 7;
#define int long long
const int inf=1e18;
#define pii pair<int, int>
#define f first
#define s second 
#define mp make_pair
#define FOR(i, n) for(int i=1;i<=n;i++)
#define TRACE(x) cerr << #x << " = " << x << endl 
//Trace prints the name of the variable and the value.
int arr[N], diff[N], s, t, n, q;
int cost(int x)
{
	if(x>0) return s*x;
	return t*x;
}
signed main()
{
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int ans=0;cin>>n>>q>>s>>t;s*=-1;t*=-1;
	for(int i=0;i<=n;i++) cin>>arr[i];
	for(int i=1;i<=n;i++) {diff[i]=arr[i]-arr[i-1];
		ans+=cost(diff[i]);//cout<<diff[i]<<" "<<ans<<endl;
	}
//			cout<<ans<<endl;	
	while(q--)
	{
		int l, r, val;cin>>l>>r>>val;
		ans-=cost(diff[l]);diff[l]+=val;ans+=cost(diff[l]);
		if(r!=n) 
		{r++;ans-=cost(diff[r]);diff[r]-=val;ans+=cost(diff[r]);}
		cout<<ans<<endl;
	}
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 518 ms 10368 KB Output is correct
2 Correct 541 ms 11128 KB Output is correct
3 Correct 538 ms 11640 KB Output is correct
4 Correct 517 ms 10872 KB Output is correct
5 Correct 561 ms 12052 KB Output is correct
6 Correct 542 ms 11192 KB Output is correct
7 Correct 524 ms 11104 KB Output is correct
8 Correct 519 ms 11952 KB Output is correct
9 Correct 523 ms 12152 KB Output is correct
10 Correct 515 ms 11124 KB Output is correct
11 Correct 485 ms 11128 KB Output is correct
12 Correct 482 ms 11768 KB Output is correct
13 Correct 525 ms 12052 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 512 KB Output is correct
2 Correct 11 ms 512 KB Output is correct
3 Correct 10 ms 512 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Correct 9 ms 512 KB Output is correct
8 Correct 9 ms 512 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 10 ms 512 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 10 ms 512 KB Output is correct
15 Correct 9 ms 512 KB Output is correct
16 Correct 10 ms 512 KB Output is correct
17 Correct 9 ms 512 KB Output is correct
18 Correct 10 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 518 ms 10368 KB Output is correct
23 Correct 541 ms 11128 KB Output is correct
24 Correct 538 ms 11640 KB Output is correct
25 Correct 517 ms 10872 KB Output is correct
26 Correct 561 ms 12052 KB Output is correct
27 Correct 542 ms 11192 KB Output is correct
28 Correct 524 ms 11104 KB Output is correct
29 Correct 519 ms 11952 KB Output is correct
30 Correct 523 ms 12152 KB Output is correct
31 Correct 515 ms 11124 KB Output is correct
32 Correct 485 ms 11128 KB Output is correct
33 Correct 482 ms 11768 KB Output is correct
34 Correct 525 ms 12052 KB Output is correct
35 Correct 527 ms 10616 KB Output is correct
36 Correct 553 ms 11896 KB Output is correct
37 Correct 522 ms 12664 KB Output is correct
38 Correct 517 ms 12760 KB Output is correct
39 Correct 503 ms 12536 KB Output is correct
40 Correct 512 ms 12536 KB Output is correct
41 Correct 507 ms 12376 KB Output is correct
42 Correct 539 ms 12608 KB Output is correct
43 Correct 509 ms 11712 KB Output is correct
44 Correct 493 ms 12028 KB Output is correct
45 Correct 517 ms 12152 KB Output is correct
46 Correct 529 ms 13208 KB Output is correct
47 Correct 506 ms 11772 KB Output is correct
48 Correct 509 ms 11768 KB Output is correct
49 Correct 495 ms 10744 KB Output is correct
50 Correct 504 ms 11632 KB Output is correct
51 Correct 514 ms 12024 KB Output is correct
52 Correct 499 ms 11896 KB Output is correct