oj.uz

Submission #749916

# Submission time Handle Problem Language Result Execution time Memory
749916 2023-05-29T00:22:13 Z guagua0407 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 119 ms 5640 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=2e5+5;
ll a[mxn];


int main() {_
    int n,q,S,T;
    cin>>n>>q>>S>>T;
    for(int i=0;i<=n;i++){
        cin>>a[i];
    }
    for(int i=n;i>=1;i--){
        a[i]-=a[i-1];
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(a[i]>0){
            ans+=1ll*S*a[i];
        }
        else{
            ans+=1ll*T*a[i];
        }
    }
    for(int i=0;i<q;i++){
        int l,r,x;
        cin>>l>>r>>x;
        if(a[l]>0){
            ans-=1ll*S*a[l];
        }
        else{
            ans-=1ll*T*a[l];
        }
        a[l]+=x;
        if(a[l]>0){
            ans+=1ll*S*a[l];
        }
        else{
            ans+=1ll*T*a[l];
        }
        if(r<n){
            if(a[r+1]>0){
                ans-=1ll*S*a[r+1];
            }
            else{
                ans-=1ll*T*a[r+1];
            }
            a[r+1]-=x;
            if(a[r+1]>0){
                ans+=1ll*S*a[r+1];
            }
            else{
                ans+=1ll*T*a[r+1];
            }
        }
        cout<<-ans<<'\n';
    }
    return 0;
}
//maybe its multiset not set

Compilation message

foehn_phenomena.cpp: In function 'void setIO(std::string)':
foehn_phenomena.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 3280 KB Output is correct
2 Correct 89 ms 3864 KB Output is correct
3 Correct 96 ms 4424 KB Output is correct
4 Correct 85 ms 3584 KB Output is correct
5 Correct 87 ms 4336 KB Output is correct
6 Correct 76 ms 4828 KB Output is correct
7 Correct 93 ms 4764 KB Output is correct
8 Correct 85 ms 4724 KB Output is correct
9 Correct 119 ms 5100 KB Output is correct
10 Correct 87 ms 3796 KB Output is correct
11 Correct 74 ms 4856 KB Output is correct
12 Correct 80 ms 5360 KB Output is correct
13 Correct 79 ms 5580 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 93 ms 3280 KB Output is correct
23 Correct 89 ms 3864 KB Output is correct
24 Correct 96 ms 4424 KB Output is correct
25 Correct 85 ms 3584 KB Output is correct
26 Correct 87 ms 4336 KB Output is correct
27 Correct 76 ms 4828 KB Output is correct
28 Correct 93 ms 4764 KB Output is correct
29 Correct 85 ms 4724 KB Output is correct
30 Correct 119 ms 5100 KB Output is correct
31 Correct 87 ms 3796 KB Output is correct
32 Correct 74 ms 4856 KB Output is correct
33 Correct 80 ms 5360 KB Output is correct
34 Correct 79 ms 5580 KB Output is correct
35 Correct 107 ms 3348 KB Output is correct
36 Correct 89 ms 4852 KB Output is correct
37 Correct 106 ms 5640 KB Output is correct
38 Correct 101 ms 5452 KB Output is correct
39 Correct 92 ms 5452 KB Output is correct
40 Correct 109 ms 5456 KB Output is correct
41 Correct 94 ms 5180 KB Output is correct
42 Correct 101 ms 5400 KB Output is correct
43 Correct 90 ms 4644 KB Output is correct
44 Correct 94 ms 5020 KB Output is correct
45 Correct 96 ms 4764 KB Output is correct
46 Correct 94 ms 5496 KB Output is correct
47 Correct 77 ms 5388 KB Output is correct
48 Correct 83 ms 5576 KB Output is correct
49 Correct 100 ms 4568 KB Output is correct
50 Correct 88 ms 5392 KB Output is correct
51 Correct 77 ms 5456 KB Output is correct
52 Correct 79 ms 5452 KB Output is correct