oj.uz

답안 #923865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923865 2024-02-08T03:44:38 Z Aiperiii Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 434 ms 21976 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=2e5+5;
int a[N],ans[N*4],t[N*4];
int n,q,s,T;
void build(int v,int tl,int tr){
   if(tl==tr){
      if(tl+1<=n){
         if(a[tl+1]>a[tl])ans[v]=(a[tl]-a[tl+1])*s;
         else ans[v]=(a[tl]-a[tl+1])*T;
      }
   }
   else{
      int tm=(tl+tr)/2;
      build(v*2,tl,tm);
      build(v*2+1,tm+1,tr);
      ans[v]=ans[v*2]+ans[v*2+1];
   }
}
void update(int v,int tl,int tr,int pos,int x){
   if(tl==tr){
      ans[v]=x;
   }
   else{
      int tm=(tl+tr)/2;
      if(pos<=tm)update(v*2,tl,tm,pos,x);
      else update(v*2+1,tm+1,tr,pos,x);
      ans[v]=ans[v*2]+ans[v*2+1];
   }
}


void add(int v,int tl,int tr,int l,int r,int x){
   if(r<tl or l>tr)return;
   if(l<=tl && tr<=r){
      t[v]+=x;
      return;
   }
   int tm=(tl+tr)/2;
   add(v*2,tl,tm,l,r,x);
   add(v*2+1,tm+1,tr,l,r,x);
}
int get(int v,int tl,int tr,int pos){
   if(tl==tr)return t[v];
   else{
      int tm=(tl+tr)/2;
      if(pos<=tm)return t[v]+get(v*2,tl,tm,pos);
      else return t[v]+get(v*2+1,tm+1,tr,pos);
   }
}
signed main(){
   ios_base::sync_with_stdio();
   cin.tie(0);cout.tie(0);
   cin>>n>>q>>s>>T;
   n++;
   for(int i=1;i<=n;i++){
      cin>>a[i];
   }
   build(1,1,n);
   while(q--){
      int l,r,x;
      cin>>l>>r>>x;
      l++;r++;
      add(1,1,n,l,r,x);
      if(l-1>=1){
         int a1=a[l-1]+get(1,1,n,l-1);
         int a2=a[l]+get(1,1,n,l);
         int new_val=0;
         
         if(a1<a2)new_val=(a1-a2)*s;
         else new_val=(a1-a2)*T;
         
         update(1,1,n,l-1,new_val);
      }
      if(r+1<=n){
         int a1=a[r]+get(1,1,n,r);
         int a2=a[r+1]+get(1,1,n,r+1);
         int new_val=0;
         if(a1<a2)new_val=(a1-a2)*s;
         else new_val=(a1-a2)*T;
         update(1,1,n,r,new_val);
      }
      cout<<ans[1]<<"\n";
   }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2396 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 4 ms 2392 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 15 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 4 ms 2612 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2580 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 3 ms 2396 KB Output is correct
17 Correct 2 ms 2580 KB Output is correct
18 Correct 3 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 18944 KB Output is correct
2 Correct 423 ms 19792 KB Output is correct
3 Correct 407 ms 20268 KB Output is correct
4 Correct 369 ms 19588 KB Output is correct
5 Correct 395 ms 20672 KB Output is correct
6 Correct 206 ms 17752 KB Output is correct
7 Correct 224 ms 17580 KB Output is correct
8 Correct 330 ms 20788 KB Output is correct
9 Correct 363 ms 21228 KB Output is correct
10 Correct 330 ms 19748 KB Output is correct
11 Correct 219 ms 17692 KB Output is correct
12 Correct 241 ms 18368 KB Output is correct
13 Correct 236 ms 18512 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2396 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 3 ms 2396 KB Output is correct
4 Correct 4 ms 2392 KB Output is correct
5 Correct 3 ms 2396 KB Output is correct
6 Correct 4 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 15 ms 2396 KB Output is correct
9 Correct 4 ms 2396 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 4 ms 2396 KB Output is correct
12 Correct 4 ms 2612 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 3 ms 2580 KB Output is correct
15 Correct 3 ms 2396 KB Output is correct
16 Correct 3 ms 2396 KB Output is correct
17 Correct 2 ms 2580 KB Output is correct
18 Correct 3 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 359 ms 18944 KB Output is correct
23 Correct 423 ms 19792 KB Output is correct
24 Correct 407 ms 20268 KB Output is correct
25 Correct 369 ms 19588 KB Output is correct
26 Correct 395 ms 20672 KB Output is correct
27 Correct 206 ms 17752 KB Output is correct
28 Correct 224 ms 17580 KB Output is correct
29 Correct 330 ms 20788 KB Output is correct
30 Correct 363 ms 21228 KB Output is correct
31 Correct 330 ms 19748 KB Output is correct
32 Correct 219 ms 17692 KB Output is correct
33 Correct 241 ms 18368 KB Output is correct
34 Correct 236 ms 18512 KB Output is correct
35 Correct 386 ms 19388 KB Output is correct
36 Correct 400 ms 20740 KB Output is correct
37 Correct 416 ms 21268 KB Output is correct
38 Correct 391 ms 21236 KB Output is correct
39 Correct 381 ms 21076 KB Output is correct
40 Correct 434 ms 21332 KB Output is correct
41 Correct 430 ms 21012 KB Output is correct
42 Correct 390 ms 21452 KB Output is correct
43 Correct 401 ms 20528 KB Output is correct
44 Correct 380 ms 20736 KB Output is correct
45 Correct 409 ms 20952 KB Output is correct
46 Correct 429 ms 21976 KB Output is correct
47 Correct 204 ms 18392 KB Output is correct
48 Correct 228 ms 18272 KB Output is correct
49 Correct 351 ms 19280 KB Output is correct
50 Correct 225 ms 18084 KB Output is correct
51 Correct 213 ms 18576 KB Output is correct
52 Correct 246 ms 18260 KB Output is correct