oj.uz

Submission #314155

# Submission time Handle Problem Language Result Execution time Memory
314155 2020-10-18T19:16:54 Z MarcoMeijer Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 408 ms 28024 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int N = (1<<20);

ll n, q, s, t;
ll a[N];

struct T {
    ll la, ra, temp;
};
T seg[N*2];
ll laz[N*2];

T comb(T l, T r) {
    T res;
    res.la = l.la;
    res.ra = r.ra;
    res.temp = l.temp + r.temp;
    if(l.ra < r.la) {
        res.temp -= (r.la-l.ra)*s;
    } else {
        res.temp += (l.ra-r.la)*t;
    }
    return res;
}
void buildSeg(int p=1, int l=0, int r=n-1) {
    laz[p] = 0;
    if(l == r) {
        seg[p] = {a[l], a[l], 0};
        return;
    }
    int m=(l+r)/2;
    buildSeg(p*2,l,m);
    buildSeg(p*2+1,m+1,r);
    seg[p] = comb(seg[p*2], seg[p*2+1]);
}
void addSeg(int i, int j, ll v, ll lazy=0, int p=1, int l=0, int r=n-1) {
    seg[p].la += lazy;
    seg[p].ra += lazy;
    laz[p] += lazy;
    if(j < l || i > r) return;
    if(i <= l && j >= r) {
        seg[p].la += v;
        seg[p].ra += v;
        laz[p] += v;
        return;
    }
    int m=(l+r)/2;
    addSeg(i,j,v,laz[p],p*2,l,m);
    addSeg(i,j,v,laz[p],p*2+1,m+1,r);
    seg[p] = comb(seg[p*2], seg[p*2+1]);
    laz[p] = 0;
}

void program() {
    IN(n,q,s,t); n++;
    RE(i,n) IN(a[i]);
    buildSeg();

    RE(i,q) {
        int l, r, x; IN(l,r,x);
        addSeg(l,r,x);
        OUTLS(seg[1].temp);
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 25284 KB Output is correct
2 Correct 404 ms 25848 KB Output is correct
3 Correct 408 ms 26464 KB Output is correct
4 Correct 383 ms 26108 KB Output is correct
5 Correct 396 ms 27000 KB Output is correct
6 Correct 201 ms 26104 KB Output is correct
7 Correct 203 ms 25976 KB Output is correct
8 Correct 333 ms 26744 KB Output is correct
9 Correct 339 ms 27128 KB Output is correct
10 Correct 332 ms 25896 KB Output is correct
11 Correct 212 ms 25848 KB Output is correct
12 Correct 200 ms 26616 KB Output is correct
13 Correct 190 ms 26860 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 544 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 2 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 640 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 400 ms 25284 KB Output is correct
23 Correct 404 ms 25848 KB Output is correct
24 Correct 408 ms 26464 KB Output is correct
25 Correct 383 ms 26108 KB Output is correct
26 Correct 396 ms 27000 KB Output is correct
27 Correct 201 ms 26104 KB Output is correct
28 Correct 203 ms 25976 KB Output is correct
29 Correct 333 ms 26744 KB Output is correct
30 Correct 339 ms 27128 KB Output is correct
31 Correct 332 ms 25896 KB Output is correct
32 Correct 212 ms 25848 KB Output is correct
33 Correct 200 ms 26616 KB Output is correct
34 Correct 190 ms 26860 KB Output is correct
35 Correct 402 ms 25464 KB Output is correct
36 Correct 399 ms 26872 KB Output is correct
37 Correct 405 ms 27512 KB Output is correct
38 Correct 405 ms 27512 KB Output is correct
39 Correct 405 ms 27384 KB Output is correct
40 Correct 399 ms 27512 KB Output is correct
41 Correct 408 ms 27244 KB Output is correct
42 Correct 397 ms 27384 KB Output is correct
43 Correct 397 ms 26616 KB Output is correct
44 Correct 406 ms 27256 KB Output is correct
45 Correct 390 ms 27000 KB Output is correct
46 Correct 397 ms 28024 KB Output is correct
47 Correct 204 ms 26616 KB Output is correct
48 Correct 183 ms 26744 KB Output is correct
49 Correct 379 ms 25724 KB Output is correct
50 Correct 217 ms 26488 KB Output is correct
51 Correct 201 ms 26872 KB Output is correct
52 Correct 263 ms 26616 KB Output is correct