oj.uz

Submission #954154

# Submission time Handle Problem Language Result Execution time Memory
954154 2024-03-27T10:46:12 Z StefanSebez Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 126 ms 15448 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=3*1e5+500;
ll p[N+50];
void Update(int i,ll qval){
	for(;i<=N;i+=i&(-i)) p[i]+=qval;
}
int Get(int i){
	ll sum=0;
	for(;i>=1;i-=i&(-i)) sum+=p[i];
	return sum;
}
//int Sum(int l,int r){return Get(r)-Get(l-1);}
int main()
{
    int n,q;ll S,T;scanf("%i%i%lld%lld",&n,&q,&S,&T);
    ll a[N+50];for(int i=0;i<=n;i++) scanf("%lld",&a[i]);
    ll b[N+50],res=0;
    for(int i=1;i<=n;i++){
		if(a[i-1]<a[i]) b[i]=(a[i-1]-a[i])*S;
		else b[i]=(a[i-1]-a[i])*T;
		res+=b[i];
    }
    //printf("%i\n",res);
    while(q--){
		int l,r;ll x;scanf("%i%i%lld",&l,&r,&x);
		Update(l,x);Update(r+1,-x);
		ll temp=b[l],u=Get(l-1)+a[l-1],v=Get(l)+a[l];
		if(u<v) b[l]=(u-v)*S;
		else b[l]=(u-v)*T;
		res+=b[l]-temp;
		//printf("%i %i %i %i\n",u,v,temp,b[l]);
		if(r+1<=n){
			temp=b[r+1],u=Get(r)+a[r],v=Get(r+1)+a[r+1];
			if(u<v) b[r+1]=(u-v)*S;
			else b[r+1]=(u-v)*T;
			res+=b[r+1]-temp;
		}
		printf("%lld\n",res);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:17:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |     int n,q;ll S,T;scanf("%i%i%lld%lld",&n,&q,&S,&T);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:18:43: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     ll a[N+50];for(int i=0;i<=n;i++) scanf("%lld",&a[i]);
      |                                      ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:27:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   int l,r;ll x;scanf("%i%i%lld",&l,&r,&x);
      |                ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7260 KB Output is correct
2 Correct 4 ms 7260 KB Output is correct
3 Correct 6 ms 7264 KB Output is correct
4 Correct 4 ms 7264 KB Output is correct
5 Correct 4 ms 7256 KB Output is correct
6 Correct 4 ms 7264 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 4 ms 7260 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 5 ms 7096 KB Output is correct
11 Correct 4 ms 7268 KB Output is correct
12 Correct 4 ms 7260 KB Output is correct
13 Correct 4 ms 7260 KB Output is correct
14 Correct 4 ms 7256 KB Output is correct
15 Correct 4 ms 7260 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 4 ms 7092 KB Output is correct
18 Correct 4 ms 7260 KB Output is correct
19 Correct 3 ms 7008 KB Output is correct
20 Correct 3 ms 7004 KB Output is correct
21 Correct 3 ms 7008 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 14140 KB Output is correct
2 Correct 108 ms 14680 KB Output is correct
3 Correct 126 ms 15388 KB Output is correct
4 Incorrect 115 ms 15448 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7260 KB Output is correct
2 Correct 4 ms 7260 KB Output is correct
3 Correct 6 ms 7264 KB Output is correct
4 Correct 4 ms 7264 KB Output is correct
5 Correct 4 ms 7256 KB Output is correct
6 Correct 4 ms 7264 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 4 ms 7260 KB Output is correct
9 Correct 4 ms 7260 KB Output is correct
10 Correct 5 ms 7096 KB Output is correct
11 Correct 4 ms 7268 KB Output is correct
12 Correct 4 ms 7260 KB Output is correct
13 Correct 4 ms 7260 KB Output is correct
14 Correct 4 ms 7256 KB Output is correct
15 Correct 4 ms 7260 KB Output is correct
16 Correct 4 ms 7260 KB Output is correct
17 Correct 4 ms 7092 KB Output is correct
18 Correct 4 ms 7260 KB Output is correct
19 Correct 3 ms 7008 KB Output is correct
20 Correct 3 ms 7004 KB Output is correct
21 Correct 3 ms 7008 KB Output is correct
22 Correct 109 ms 14140 KB Output is correct
23 Correct 108 ms 14680 KB Output is correct
24 Correct 126 ms 15388 KB Output is correct
25 Incorrect 115 ms 15448 KB Output isn't correct
26 Halted 0 ms 0 KB -