oj.uz

Submission #950732

# Submission time Handle Problem Language Result Execution time Memory
950732 2024-03-20T15:53:04 Z tnknguyen_ Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 1000 ms 18256 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n' 

const int sz = 2e5 + 5;
vector<int> qr[sz];
long long a[sz];
int n, q, s, t;

// ------------ SUBTASKS ------------
namespace SUB1{
    bool ok(){
        return (n <= 2000 && q <= 2000);
    }

    void solve(){
        for(int i=1; i<=q; ++i){
            int l = qr[i][0], r = qr[i][1], x = qr[i][2];
            int ans = 0;
            for(int j=1; j<=n; ++j){
                if(j >= l && j <= r){
                    a[j] += x;
                }
                if(a[j-1] < a[j]){
                    ans -= (a[j] - a[j-1])*s;
                }
                else{
                    ans += (a[j-1] - a[j])*t;
                }
            }
            cout<<ans<<endl;
        }
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    //freopen("main.inp","r",stdin);
    //freopen("main.out","w",stdout);

    cin>>n>>q>>s>>t;
    for(int i=0; i<=n; ++i){
        cin>>a[i];
    }
    
    for(int i=1; i<=q; ++i){
        int l, r, x;
        cin>>l>>r>>x;
        qr[i] = {l, r, x};
    }

    SUB1::solve();

    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6488 KB Output is correct
2 Correct 11 ms 6492 KB Output is correct
3 Correct 11 ms 6668 KB Output is correct
4 Correct 11 ms 6696 KB Output is correct
5 Correct 11 ms 6668 KB Output is correct
6 Correct 11 ms 6492 KB Output is correct
7 Correct 11 ms 6672 KB Output is correct
8 Correct 11 ms 6492 KB Output is correct
9 Correct 11 ms 6688 KB Output is correct
10 Correct 11 ms 6492 KB Output is correct
11 Correct 10 ms 6492 KB Output is correct
12 Correct 10 ms 6492 KB Output is correct
13 Correct 7 ms 6552 KB Output is correct
14 Correct 12 ms 6548 KB Output is correct
15 Correct 16 ms 6548 KB Output is correct
16 Correct 8 ms 6492 KB Output is correct
17 Correct 7 ms 6492 KB Output is correct
18 Correct 7 ms 6672 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1036 ms 18256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6488 KB Output is correct
2 Correct 11 ms 6492 KB Output is correct
3 Correct 11 ms 6668 KB Output is correct
4 Correct 11 ms 6696 KB Output is correct
5 Correct 11 ms 6668 KB Output is correct
6 Correct 11 ms 6492 KB Output is correct
7 Correct 11 ms 6672 KB Output is correct
8 Correct 11 ms 6492 KB Output is correct
9 Correct 11 ms 6688 KB Output is correct
10 Correct 11 ms 6492 KB Output is correct
11 Correct 10 ms 6492 KB Output is correct
12 Correct 10 ms 6492 KB Output is correct
13 Correct 7 ms 6552 KB Output is correct
14 Correct 12 ms 6548 KB Output is correct
15 Correct 16 ms 6548 KB Output is correct
16 Correct 8 ms 6492 KB Output is correct
17 Correct 7 ms 6492 KB Output is correct
18 Correct 7 ms 6672 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Execution timed out 1036 ms 18256 KB Time limit exceeded
23 Halted 0 ms 0 KB -