oj.uz

답안 #869780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
869780 2023-11-05T15:57:24 Z epicci23 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 92 ms 13096 KB 
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define endl "\n" 
#define int long long
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 * SIMPLIFY THE PROBLEM
 * READ THE STATEMENT CAREFULLY
  !!! if there is an specified/interesting smth(i.e. constraint) in the statement,
  then you must be careful about that   
*/

void solve(){
	int n,q,s,t;
	cin >> n >> q >> s >> t;
   
   s*=-1;
   t*=-1;

   int ar[n+5];
   int diff[n+5];

   for(int i=0;i<=n;i++) cin >> ar[i];
    
   for(int i=1;i<=n;i++) diff[i]=ar[i]-ar[i-1];

   int ans=0;

   for(int i=1;i<=n;i++){
     if(diff[i]>0) ans+=s*diff[i];
     else ans+=t*diff[i];
   }
    
   

    while(q--){
     
      int l,r,x;
      cin >> l >> r >> x;
      
      if(diff[l]>0) ans-=s*diff[l];
      else ans-=t*diff[l];
      
      if(r+1<=n){ 
       if(diff[r+1]>0) ans-=s*diff[r+1];
       else ans-=t*diff[r+1];
      }
      diff[l]+=x;
      diff[r+1]-=x;


      if(diff[l]>0) ans+=s*diff[l];
      else ans+=t*diff[l];
      
      if(r+1<=n){ 
       if(diff[r+1]>0) ans+=s*diff[r+1];
       else ans+=t*diff[r+1];
      }

      cout << ans << endl;
    }
}

int32_t main(){

  cin.tie(0); ios::sync_with_stdio(0);
  
  int t=1;//cin >> t;
  while(t--) solve();

  return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 536 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 10320 KB Output is correct
2 Correct 75 ms 10916 KB Output is correct
3 Correct 82 ms 11860 KB Output is correct
4 Correct 74 ms 11000 KB Output is correct
5 Correct 75 ms 12116 KB Output is correct
6 Correct 67 ms 11060 KB Output is correct
7 Correct 66 ms 11088 KB Output is correct
8 Correct 77 ms 11944 KB Output is correct
9 Correct 78 ms 12292 KB Output is correct
10 Correct 76 ms 10828 KB Output is correct
11 Correct 63 ms 10968 KB Output is correct
12 Correct 65 ms 11800 KB Output is correct
13 Correct 68 ms 11856 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 536 KB Output is correct
4 Correct 1 ms 532 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 73 ms 10320 KB Output is correct
23 Correct 75 ms 10916 KB Output is correct
24 Correct 82 ms 11860 KB Output is correct
25 Correct 74 ms 11000 KB Output is correct
26 Correct 75 ms 12116 KB Output is correct
27 Correct 67 ms 11060 KB Output is correct
28 Correct 66 ms 11088 KB Output is correct
29 Correct 77 ms 11944 KB Output is correct
30 Correct 78 ms 12292 KB Output is correct
31 Correct 76 ms 10828 KB Output is correct
32 Correct 63 ms 10968 KB Output is correct
33 Correct 65 ms 11800 KB Output is correct
34 Correct 68 ms 11856 KB Output is correct
35 Correct 73 ms 10344 KB Output is correct
36 Correct 77 ms 11756 KB Output is correct
37 Correct 92 ms 12628 KB Output is correct
38 Correct 83 ms 12564 KB Output is correct
39 Correct 79 ms 12372 KB Output is correct
40 Correct 83 ms 12580 KB Output is correct
41 Correct 78 ms 12368 KB Output is correct
42 Correct 78 ms 12484 KB Output is correct
43 Correct 77 ms 11656 KB Output is correct
44 Correct 78 ms 12060 KB Output is correct
45 Correct 74 ms 12112 KB Output is correct
46 Correct 77 ms 13096 KB Output is correct
47 Correct 70 ms 11604 KB Output is correct
48 Correct 68 ms 11856 KB Output is correct
49 Correct 66 ms 10804 KB Output is correct
50 Correct 66 ms 11604 KB Output is correct
51 Correct 71 ms 12120 KB Output is correct
52 Correct 65 ms 11604 KB Output is correct