oj.uz

Submission #46639

# Submission time Handle Problem Language Result Execution time Memory
46639 2018-04-22T12:25:01 Z eropsergeev Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 179 ms 7548 KB 
#ifdef LOCKAL
    #define _GLIBCXX_DEBUG
#endif
//#ifndef LOCKAL
    #pragma GCC optimize("Ofast")
    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,mmx,avx")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC optimize("unroll-all-loops")
//#endif
#include <bits/stdc++.h>
//#define TIMUS
//#define FILENAME "journey"
#ifndef TIMUS
    #include <ext/rope>
    #include <ext/pb_ds/assoc_container.hpp>
#endif // TIMUS
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pb push_back
#define pii pair<int, int>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF = INT_MAX / 2;
const ll LINF = (ll)2e18 + 666, M = 1e9 + 7;
const ld EPS = 1e-7;

#ifndef M_PI
    const ld M_PI = acos(-1);
#endif // M_PI

using namespace std;

#ifndef TIMUS
    using namespace __gnu_cxx;
    using namespace __gnu_pbds;

    template<class K, class T>
    using ordered_map = tree<K, T, less<K>, rb_tree_tag, tree_order_statistics_node_update>;

    template<class T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif

void run();

template<class T1, class T2>
inline bool mini(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

template<class T1, class T2>
inline bool maxi(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}

int main()
{
    #ifndef LOCKAL
        #ifdef FILENAME
            freopen(FILENAME".in", "r", stdin);
            freopen(FILENAME".out", "w", stdout);
        #endif // FILENAME
    #endif
    #ifndef TIMUS
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    #endif // TIMUS
    srand(time(0));
    auto start = clock();
    run();
    #ifdef LOCKAL
        //cout << endl;
        cout << "\ntime = " << (ld)(clock() - start) / CLOCKS_PER_SEC << "\n";
    #endif
    return 0;
}

//#define DEBUG
#if defined DEBUG && defined LOCKAL
    #define debugdo(x) x
#else
    #define debugdo(x)
#endif

#define debug_for(x) debug(#x": "); debugdo(for (auto &_x: x)) debug2(_x); debug("")
#define debug(x) debugdo(cout << x << endl)
#define debug2(x) debugdo(cout << x << " ")

// ---SOLUTION--- //

//#define FAST 1e9
#ifdef FAST
    char buf[(int)FAST];
    size_t p = 0;
    inline void *operator new(size_t n)
    {
        p += n;
        return buf + p - n;
    }
    inline void operator delete(void *){}
#endif

void run()
{
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    vector<ll> a(n + 1);
    for (int i = 0; i <= n; i++)
        cin >> a[i];
    vector<ll> d(n + 1);
    d[0] = 0;
    for (int i = 1; i <= n; i++)
        d[i] = a[i] - a[i - 1];
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        if (d[i] > 0)
            ans += s * d[i];
        else
            ans += t * d[i];
    }
    while (q--)
    {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        if (d[l] > 0)
            ans -= d[l] * s;
        else
            ans -= d[l] * t;
        d[l] += x;
        if (d[l] > 0)
            ans += d[l] * s;
        else
            ans += d[l] * t;
        if (r < n)
        {
            if (d[r + 1] > 0)
                ans -= d[r + 1] * s;
            else
                ans -= d[r + 1] * t;
            d[r + 1] -= x;
            if (d[r + 1] > 0)
                ans += d[r + 1] * s;
            else
                ans += d[r + 1] * t;
        }
        cout << -ans << "\n";
    }
}
/*
+1
-2
0 6 3  8
0 1 -1 0
*/

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:86:10: warning: unused variable 'start' [-Wunused-variable]
     auto start = clock();
          ^~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 5196 KB Output is correct
2 Correct 158 ms 5776 KB Output is correct
3 Correct 163 ms 6316 KB Output is correct
4 Correct 140 ms 6316 KB Output is correct
5 Correct 154 ms 6316 KB Output is correct
6 Correct 116 ms 6756 KB Output is correct
7 Correct 114 ms 6756 KB Output is correct
8 Correct 150 ms 6756 KB Output is correct
9 Correct 145 ms 6900 KB Output is correct
10 Correct 140 ms 6900 KB Output is correct
11 Correct 112 ms 6900 KB Output is correct
12 Correct 122 ms 7016 KB Output is correct
13 Correct 127 ms 7512 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 612 KB Output is correct
3 Correct 4 ms 612 KB Output is correct
4 Correct 3 ms 612 KB Output is correct
5 Correct 4 ms 648 KB Output is correct
6 Correct 3 ms 700 KB Output is correct
7 Correct 3 ms 708 KB Output is correct
8 Correct 4 ms 712 KB Output is correct
9 Correct 4 ms 712 KB Output is correct
10 Correct 3 ms 712 KB Output is correct
11 Correct 3 ms 712 KB Output is correct
12 Correct 4 ms 712 KB Output is correct
13 Correct 3 ms 712 KB Output is correct
14 Correct 3 ms 712 KB Output is correct
15 Correct 4 ms 712 KB Output is correct
16 Correct 4 ms 804 KB Output is correct
17 Correct 3 ms 804 KB Output is correct
18 Correct 4 ms 804 KB Output is correct
19 Correct 2 ms 804 KB Output is correct
20 Correct 2 ms 804 KB Output is correct
21 Correct 2 ms 804 KB Output is correct
22 Correct 152 ms 5196 KB Output is correct
23 Correct 158 ms 5776 KB Output is correct
24 Correct 163 ms 6316 KB Output is correct
25 Correct 140 ms 6316 KB Output is correct
26 Correct 154 ms 6316 KB Output is correct
27 Correct 116 ms 6756 KB Output is correct
28 Correct 114 ms 6756 KB Output is correct
29 Correct 150 ms 6756 KB Output is correct
30 Correct 145 ms 6900 KB Output is correct
31 Correct 140 ms 6900 KB Output is correct
32 Correct 112 ms 6900 KB Output is correct
33 Correct 122 ms 7016 KB Output is correct
34 Correct 127 ms 7512 KB Output is correct
35 Correct 140 ms 7512 KB Output is correct
36 Correct 146 ms 7512 KB Output is correct
37 Correct 164 ms 7512 KB Output is correct
38 Correct 162 ms 7512 KB Output is correct
39 Correct 165 ms 7512 KB Output is correct
40 Correct 179 ms 7512 KB Output is correct
41 Correct 150 ms 7512 KB Output is correct
42 Correct 158 ms 7512 KB Output is correct
43 Correct 162 ms 7512 KB Output is correct
44 Correct 151 ms 7512 KB Output is correct
45 Correct 161 ms 7512 KB Output is correct
46 Correct 147 ms 7512 KB Output is correct
47 Correct 122 ms 7512 KB Output is correct
48 Correct 120 ms 7548 KB Output is correct
49 Correct 155 ms 7548 KB Output is correct
50 Correct 114 ms 7548 KB Output is correct
51 Correct 128 ms 7548 KB Output is correct
52 Correct 113 ms 7548 KB Output is correct