oj.uz

Submission #56873

# Submission time Handle Problem Language Result Execution time Memory
56873 2018-07-13T01:45:50 Z Benq Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 262 ms 169860 KB 
#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;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

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

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,Q,S,T;
ll sum;
vl A, dif;

ll calc(int x) {
    if (dif[x] > 0) return -S*dif[x];
    return -T*dif[x];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> Q >> S >> T; A.resize(N+1);
    F0R(i,N+1) cin >> A[i];
    F0R(i,N) {
        dif.pb(A[i+1]-A[i]);
        sum += calc(i);
    }
    F0R(i,Q) {
        int L,R,X; cin >> L >> R >> X;
        if (L) {
            sum -= calc(L-1);
            dif[L-1] += X;
            sum += calc(L-1);
        }
        if (R < N) {
            sum -= calc(R);
            dif[R] -= X;
            sum += calc(R);
        }
        cout << sum << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 672 KB Output is correct
3 Correct 4 ms 972 KB Output is correct
4 Correct 4 ms 1000 KB Output is correct
5 Correct 4 ms 1008 KB Output is correct
6 Correct 7 ms 1124 KB Output is correct
7 Correct 4 ms 1236 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 4 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 5 ms 1440 KB Output is correct
12 Correct 4 ms 1492 KB Output is correct
13 Correct 3 ms 1660 KB Output is correct
14 Correct 4 ms 1660 KB Output is correct
15 Correct 4 ms 1660 KB Output is correct
16 Correct 5 ms 1712 KB Output is correct
17 Correct 4 ms 1712 KB Output is correct
18 Correct 4 ms 1932 KB Output is correct
19 Correct 4 ms 1932 KB Output is correct
20 Correct 2 ms 1932 KB Output is correct
21 Correct 3 ms 1932 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 11784 KB Output is correct
2 Correct 148 ms 17884 KB Output is correct
3 Correct 174 ms 23848 KB Output is correct
4 Correct 179 ms 28632 KB Output is correct
5 Correct 193 ms 35480 KB Output is correct
6 Correct 141 ms 40584 KB Output is correct
7 Correct 172 ms 45304 KB Output is correct
8 Correct 146 ms 50604 KB Output is correct
9 Correct 158 ms 56476 KB Output is correct
10 Correct 169 ms 60648 KB Output is correct
11 Correct 109 ms 66152 KB Output is correct
12 Correct 126 ms 71484 KB Output is correct
13 Correct 125 ms 76568 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 672 KB Output is correct
3 Correct 4 ms 972 KB Output is correct
4 Correct 4 ms 1000 KB Output is correct
5 Correct 4 ms 1008 KB Output is correct
6 Correct 7 ms 1124 KB Output is correct
7 Correct 4 ms 1236 KB Output is correct
8 Correct 6 ms 1408 KB Output is correct
9 Correct 4 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 5 ms 1440 KB Output is correct
12 Correct 4 ms 1492 KB Output is correct
13 Correct 3 ms 1660 KB Output is correct
14 Correct 4 ms 1660 KB Output is correct
15 Correct 4 ms 1660 KB Output is correct
16 Correct 5 ms 1712 KB Output is correct
17 Correct 4 ms 1712 KB Output is correct
18 Correct 4 ms 1932 KB Output is correct
19 Correct 4 ms 1932 KB Output is correct
20 Correct 2 ms 1932 KB Output is correct
21 Correct 3 ms 1932 KB Output is correct
22 Correct 178 ms 11784 KB Output is correct
23 Correct 148 ms 17884 KB Output is correct
24 Correct 174 ms 23848 KB Output is correct
25 Correct 179 ms 28632 KB Output is correct
26 Correct 193 ms 35480 KB Output is correct
27 Correct 141 ms 40584 KB Output is correct
28 Correct 172 ms 45304 KB Output is correct
29 Correct 146 ms 50604 KB Output is correct
30 Correct 158 ms 56476 KB Output is correct
31 Correct 169 ms 60648 KB Output is correct
32 Correct 109 ms 66152 KB Output is correct
33 Correct 126 ms 71484 KB Output is correct
34 Correct 125 ms 76568 KB Output is correct
35 Correct 135 ms 79736 KB Output is correct
36 Correct 253 ms 86612 KB Output is correct
37 Correct 262 ms 92856 KB Output is correct
38 Correct 152 ms 97964 KB Output is correct
39 Correct 174 ms 103580 KB Output is correct
40 Correct 233 ms 108860 KB Output is correct
41 Correct 172 ms 114132 KB Output is correct
42 Correct 165 ms 119684 KB Output is correct
43 Correct 176 ms 124336 KB Output is correct
44 Correct 207 ms 130152 KB Output is correct
45 Correct 182 ms 135608 KB Output is correct
46 Correct 175 ms 142256 KB Output is correct
47 Correct 142 ms 146884 KB Output is correct
48 Correct 183 ms 151536 KB Output is correct
49 Correct 226 ms 155140 KB Output is correct
50 Correct 149 ms 160356 KB Output is correct
51 Correct 148 ms 165252 KB Output is correct
52 Correct 149 ms 169860 KB Output is correct