oj.uz

Submission #216175

# Submission time Handle Problem Language Result Execution time Memory
216175 2020-03-26T20:36:18 Z rqi Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 632 ms 19836 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

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

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair 
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
    bool fst = 1; str res = "{";
    F0R(i,sz(v)) {
        if (!fst) res += ", ";
        fst = 0; res += ts(v[i]);
    }
    res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class T> str ts(T v) {
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

/**
 * Description: 1D range update and query. Set SZ to a power of 2.
 * Source: USACO Counting Haybales
 * Verification: SPOJ Horrible
 */

template<class T, int SZ> struct LazySeg { 
    T sum[2*SZ], lazy[2*SZ]; 
    LazySeg() { F0R(i,2*SZ) sum[i] = lazy[i] = 0; }
    void push(int ind, int L, int R) { /// modify values for current node
        if (L != R) F0R(i,2) lazy[2*ind+i] += lazy[ind]; /// prop to children
        sum[ind] += (R-L+1)*lazy[ind]; lazy[ind] = 0; 
    } // recalc values for current node
    void pull(int ind) { sum[ind] = sum[2*ind]+sum[2*ind+1]; }
    void build() { ROF(i,1,SZ) pull(i); }
    void upd(int lo,int hi,T inc,int ind=1,int L=0, int R=SZ-1) {
        push(ind,L,R); if (hi < L || R < lo) return;
        if (lo <= L && R <= hi) { 
            lazy[ind] = inc; push(ind,L,R); return; }
        int M = (L+R)/2;
        upd(lo,hi,inc,2*ind,L,M); upd(lo,hi,inc,2*ind+1,M+1,R); 
        pull(ind);
    }
    T qsum(int lo, int hi, int ind=1, int L=0, int R = SZ-1) {
        push(ind,L,R); if (lo > R || L > hi) return 0;
        if (lo <= L && R <= hi) return sum[ind];
        int M = (L+R)/2; 
        return qsum(lo,hi,2*ind,L,M)+qsum(lo,hi,2*ind+1,M+1,R);
    }
};


int N, Q;
ll S, T;
LazySeg<ll, 262144> seg;
ll curans;
ll A[200005];

ll getval(ll a, ll b){
    ll diff = abs(a-b);
    if(a < b){
        return (S)*diff;
    }
    return (T)*diff;
}

int main() {
    setIO();
    
    cin >> N >> Q >> S >> T;
    S = -S;
    for(int i = 0; i <= N; i++){
        cin >> A[i];
        seg.upd(i, i, A[i]);
    }
    for(int i = 1; i <= N; i++){
        curans+=getval(A[i-1], A[i]);
    }


    //ps(seg.qsum(0, 0));
    for(int i = 1; i <= Q; i++){
        int L, R;
        ll X;
        cin >> L >> R >> X;
        ll ol = seg.qsum(L, L);
        ll nl = ol+X;
        ll oL = seg.qsum(L-1, L-1);
        curans+=getval(oL, nl)-getval(oL, ol);
        if(R < N){
            ll r1 = seg.qsum(R, R);
            ll r2 = r1+X;
            ll oR = seg.qsum(R+1, R+1);
            curans+=getval(r2, oR)-getval(r1, oR);
        }

        seg.upd(L, R, X);
        ps(curans);
    }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

foehn_phenomena.cpp: In function 'void setIn(std::__cxx11::string)':
foehn_phenomena.cpp:123:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp: In function 'void setOut(std::__cxx11::string)':
foehn_phenomena.cpp:124:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 15992 KB Output is correct
2 Correct 587 ms 17660 KB Output is correct
3 Correct 577 ms 18296 KB Output is correct
4 Correct 578 ms 17576 KB Output is correct
5 Correct 602 ms 18808 KB Output is correct
6 Correct 483 ms 17784 KB Output is correct
7 Correct 470 ms 17656 KB Output is correct
8 Correct 521 ms 18568 KB Output is correct
9 Correct 528 ms 18808 KB Output is correct
10 Correct 502 ms 17656 KB Output is correct
11 Correct 407 ms 17660 KB Output is correct
12 Correct 504 ms 18580 KB Output is correct
13 Correct 466 ms 18680 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8576 KB Output is correct
2 Correct 13 ms 8576 KB Output is correct
3 Correct 13 ms 8576 KB Output is correct
4 Correct 13 ms 8576 KB Output is correct
5 Correct 13 ms 8576 KB Output is correct
6 Correct 13 ms 8576 KB Output is correct
7 Correct 14 ms 8576 KB Output is correct
8 Correct 15 ms 8704 KB Output is correct
9 Correct 14 ms 8576 KB Output is correct
10 Correct 13 ms 8576 KB Output is correct
11 Correct 13 ms 8576 KB Output is correct
12 Correct 13 ms 8576 KB Output is correct
13 Correct 13 ms 8576 KB Output is correct
14 Correct 12 ms 8576 KB Output is correct
15 Correct 13 ms 8576 KB Output is correct
16 Correct 12 ms 8576 KB Output is correct
17 Correct 13 ms 8576 KB Output is correct
18 Correct 14 ms 8576 KB Output is correct
19 Correct 10 ms 8576 KB Output is correct
20 Correct 9 ms 8576 KB Output is correct
21 Correct 9 ms 8576 KB Output is correct
22 Correct 579 ms 15992 KB Output is correct
23 Correct 587 ms 17660 KB Output is correct
24 Correct 577 ms 18296 KB Output is correct
25 Correct 578 ms 17576 KB Output is correct
26 Correct 602 ms 18808 KB Output is correct
27 Correct 483 ms 17784 KB Output is correct
28 Correct 470 ms 17656 KB Output is correct
29 Correct 521 ms 18568 KB Output is correct
30 Correct 528 ms 18808 KB Output is correct
31 Correct 502 ms 17656 KB Output is correct
32 Correct 407 ms 17660 KB Output is correct
33 Correct 504 ms 18580 KB Output is correct
34 Correct 466 ms 18680 KB Output is correct
35 Correct 584 ms 17376 KB Output is correct
36 Correct 589 ms 18680 KB Output is correct
37 Correct 598 ms 19324 KB Output is correct
38 Correct 596 ms 19192 KB Output is correct
39 Correct 612 ms 19192 KB Output is correct
40 Correct 607 ms 19320 KB Output is correct
41 Correct 600 ms 19192 KB Output is correct
42 Correct 611 ms 19064 KB Output is correct
43 Correct 566 ms 18296 KB Output is correct
44 Correct 632 ms 18808 KB Output is correct
45 Correct 571 ms 18808 KB Output is correct
46 Correct 579 ms 19836 KB Output is correct
47 Correct 512 ms 18336 KB Output is correct
48 Correct 395 ms 18424 KB Output is correct
49 Correct 549 ms 17400 KB Output is correct
50 Correct 427 ms 18168 KB Output is correct
51 Correct 496 ms 18680 KB Output is correct
52 Correct 533 ms 18552 KB Output is correct