oj.uz

Submission #917099

# Submission time Handle Problem Language Result Execution time Memory
917099 2024-01-27T07:22:29 Z chirathnirodha Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 327 ms 13212 KB 
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const ll mod=1e9+7;
inline void io(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
}
void solve(){
    io();
	ll n,q,s,t;cin>>n>>q>>s>>t;
	ll a[n+1];
	ll b[n];
	ll ans=0;
	for(int i=0;i<=n;i++){
		cin>>a[i];
		if(i==0)continue;
		b[i-1]=a[i]-a[i-1];
		if(b[i-1]>0)ans-=s*(b[i-1]);
		else ans-=t*b[i-1];
	}
	while(q--){
		ll x,y,z;cin>>x>>y>>z;
		if(b[x-1]>0)ans+=s*b[x-1];
		else ans+=t*b[x-1];
		b[x-1]+=z;
		if(b[x-1]>0)ans-=s*b[x-1];
		else ans-=t*b[x-1];
		
		if(y==n){cout<<ans<<endl;continue;}

		if(b[y]>0)ans+=s*b[y];
		else ans+=t*b[y];
		b[y]-=z;
		if(b[y]>0)ans-=s*b[y];
		else ans-=t*b[y];
		cout<<ans<<endl;
	}
}
int main(){
    io();
	solve();
	//int t;cin>>t;for(int i=0;i<t;i++)solve();
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 10320 KB Output is correct
2 Correct 310 ms 11116 KB Output is correct
3 Correct 294 ms 11364 KB Output is correct
4 Correct 303 ms 11064 KB Output is correct
5 Correct 292 ms 12044 KB Output is correct
6 Correct 282 ms 11284 KB Output is correct
7 Correct 281 ms 11036 KB Output is correct
8 Correct 327 ms 12308 KB Output is correct
9 Correct 297 ms 12112 KB Output is correct
10 Correct 286 ms 10960 KB Output is correct
11 Correct 278 ms 10836 KB Output is correct
12 Correct 281 ms 11600 KB Output is correct
13 Correct 289 ms 12028 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 4 ms 536 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 4 ms 552 KB Output is correct
13 Correct 3 ms 360 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 287 ms 10320 KB Output is correct
23 Correct 310 ms 11116 KB Output is correct
24 Correct 294 ms 11364 KB Output is correct
25 Correct 303 ms 11064 KB Output is correct
26 Correct 292 ms 12044 KB Output is correct
27 Correct 282 ms 11284 KB Output is correct
28 Correct 281 ms 11036 KB Output is correct
29 Correct 327 ms 12308 KB Output is correct
30 Correct 297 ms 12112 KB Output is correct
31 Correct 286 ms 10960 KB Output is correct
32 Correct 278 ms 10836 KB Output is correct
33 Correct 281 ms 11600 KB Output is correct
34 Correct 289 ms 12028 KB Output is correct
35 Correct 290 ms 10320 KB Output is correct
36 Correct 309 ms 11760 KB Output is correct
37 Correct 297 ms 12628 KB Output is correct
38 Correct 298 ms 12380 KB Output is correct
39 Correct 302 ms 12368 KB Output is correct
40 Correct 300 ms 12372 KB Output is correct
41 Correct 307 ms 12368 KB Output is correct
42 Correct 302 ms 12264 KB Output is correct
43 Correct 291 ms 11604 KB Output is correct
44 Correct 294 ms 12180 KB Output is correct
45 Correct 289 ms 12172 KB Output is correct
46 Correct 301 ms 13212 KB Output is correct
47 Correct 280 ms 11752 KB Output is correct
48 Correct 284 ms 11744 KB Output is correct
49 Correct 290 ms 10620 KB Output is correct
50 Correct 280 ms 11604 KB Output is correct
51 Correct 289 ms 11932 KB Output is correct
52 Correct 282 ms 11744 KB Output is correct