oj.uz

Submission #160303

# Submission time Handle Problem Language Result Execution time Memory
160303 2019-10-26T19:08:40 Z 12tqian Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 727 ms 13304 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 2e5 + 5;
ll a[MAX];
ll diff[MAX];
int main(){
    fast_io();
    ll n, q, s, t;
    cin >> n >> q >> s >> t;
    f0r(i, n+1){
        cin >> a[i];
        if(i != 0) diff[i] = a[i] - a[i-1];
    }
    ll ans = 0;
    f0r(i, n){
        if(a[i] < a[i+1]){
            ans -= s*(a[i+1] - a[i]);
        }
        else{
            ans += t*(a[i] - a[i+1]);
        }
    }
    while(q--){
        int l, r, x;
        cin >> l >> r >> x;
        ll d1 = diff[l];
        ll d2 = diff[r+1];
        if(l != 0){
            diff[l] += x;
        }
        diff[r+1] -= x;
        if(l != 0){
            if(d1>0){
                ans += s*(d1);
            }
            else{
                ans += t*(d1);
            }
            if(d1+x>0){
                ans -= s*(d1+x);
            }
            else{
                ans -= t*(d1+x);
            }
        }
        if(r != n){
            if(d2>0){
                ans += s*(d2);
            }
            else{
                ans += t*(d2);
            }
            if(d2-x>0){
                ans -= s*(d2-x);
            }
            else{
                ans -= t*(d2-x);
            }
        }
        cout << ans << endl;

    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void io(std::__cxx11::string)':
foehn_phenomena.cpp:49:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:50:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 663 ms 5284 KB Output is correct
2 Correct 661 ms 11128 KB Output is correct
3 Correct 704 ms 11516 KB Output is correct
4 Correct 659 ms 11000 KB Output is correct
5 Correct 699 ms 12104 KB Output is correct
6 Correct 633 ms 11252 KB Output is correct
7 Correct 640 ms 11256 KB Output is correct
8 Correct 676 ms 12024 KB Output is correct
9 Correct 690 ms 12408 KB Output is correct
10 Correct 694 ms 11128 KB Output is correct
11 Correct 654 ms 11048 KB Output is correct
12 Correct 636 ms 11768 KB Output is correct
13 Correct 676 ms 12036 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 376 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 9 ms 376 KB Output is correct
5 Correct 9 ms 376 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 9 ms 376 KB Output is correct
10 Correct 10 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 16 ms 376 KB Output is correct
13 Correct 8 ms 376 KB Output is correct
14 Correct 8 ms 376 KB Output is correct
15 Correct 8 ms 376 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 8 ms 488 KB Output is correct
18 Correct 8 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 663 ms 5284 KB Output is correct
23 Correct 661 ms 11128 KB Output is correct
24 Correct 704 ms 11516 KB Output is correct
25 Correct 659 ms 11000 KB Output is correct
26 Correct 699 ms 12104 KB Output is correct
27 Correct 633 ms 11252 KB Output is correct
28 Correct 640 ms 11256 KB Output is correct
29 Correct 676 ms 12024 KB Output is correct
30 Correct 690 ms 12408 KB Output is correct
31 Correct 694 ms 11128 KB Output is correct
32 Correct 654 ms 11048 KB Output is correct
33 Correct 636 ms 11768 KB Output is correct
34 Correct 676 ms 12036 KB Output is correct
35 Correct 658 ms 10576 KB Output is correct
36 Correct 670 ms 12116 KB Output is correct
37 Correct 673 ms 12664 KB Output is correct
38 Correct 675 ms 12664 KB Output is correct
39 Correct 691 ms 12536 KB Output is correct
40 Correct 668 ms 12528 KB Output is correct
41 Correct 680 ms 12408 KB Output is correct
42 Correct 680 ms 12628 KB Output is correct
43 Correct 682 ms 11768 KB Output is correct
44 Correct 727 ms 12280 KB Output is correct
45 Correct 673 ms 12408 KB Output is correct
46 Correct 716 ms 13304 KB Output is correct
47 Correct 644 ms 11896 KB Output is correct
48 Correct 638 ms 11896 KB Output is correct
49 Correct 645 ms 10744 KB Output is correct
50 Correct 628 ms 11620 KB Output is correct
51 Correct 635 ms 12148 KB Output is correct
52 Correct 635 ms 11868 KB Output is correct