oj.uz

Submission #977418

# Submission time Handle Problem Language Result Execution time Memory
977418 2024-05-07T23:18:12 Z thegamercoder19 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 535 ms 40660 KB 
/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, q, s, t, l, r, x, tc, sc;
V<ll> a;
struct node
{
    ll pf, sf, tc, sc;// , lc, gc;
};
node cmb(node a, node b)
{
    node res = {};
    res.pf = a.pf, res.sf = b.sf, res.tc = a.tc + b.tc, res.sc = a.sc + b.sc;
    //res.lc = a.lc + b.lc, res.gc = a.gc + b.gc;
    if (a.sf >= b.pf) res.tc += a.sf - b.pf;// , res.gc++;
    else res.sc += b.pf - a.sf;// , res.lc++;
    RET res;
}

V<node> st;
V<ll> lz;

void push(ll u, ll l, ll r)
{
    st[u].pf += lz[u], st[u].sf += lz[u];
    //st[u].sc += st[u].lc * lz[u], st[u].tc += st[u].gc * lz[u];
    if (l != r) lz[u << 1] += lz[u], lz[u << 1 | 1] += lz[u];
    lz[u] = 0;
}

void build(ll u, ll l, ll r)
{
    if (l == r) { st[u].pf = st[u].sf =  a[l]; RET; }
    ll m = (l + r) >> 1;
    build(u << 1, l, m); build(u << 1 | 1, m + 1, r);
    st[u] = cmb(st[u << 1], st[u << 1 | 1]);
}

void upd(ll u, ll l, ll r, ll ql, ll qr, ll x)
{
    push(u, l, r);
    if (l > qr || ql > r)RET;
    if (ql <= l && r <= qr)
    {
        lz[u] += x;
        push(u, l, r);
        RET;
    }
    ll m = (l + r) >> 1;
    upd(u << 1, l, m, ql, qr, x); upd(u << 1 | 1, m + 1, r, ql, qr, x);
    st[u] = cmb(st[u << 1], st[u << 1 | 1]);
}

void solve()
{
    cin >> n >> q >> s >> t;
    n++;
    a.resize(n); st.resize(4 * n + 1); lz.resize(4 * n + 1);
    FOR(ll, i, 0, n, 1)cin >> a[i];
    build(1, 0, n - 1);
    //auto res = st[1];
    //cout << res.tc * t - res.sc * s << endl;
    WHI(q)
    {
        cin >> l >> r >> x;
        upd(1, 0, n - 1, l, r, x);
        auto res = st[1];
        cout << res.tc * t - res.sc * s << endl;
    }

}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void init()':
foehn_phenomena.cpp:124:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  124 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 37760 KB Output is correct
2 Correct 476 ms 38592 KB Output is correct
3 Correct 469 ms 38944 KB Output is correct
4 Correct 464 ms 38048 KB Output is correct
5 Correct 457 ms 39144 KB Output is correct
6 Correct 362 ms 38824 KB Output is correct
7 Correct 362 ms 38652 KB Output is correct
8 Correct 431 ms 39252 KB Output is correct
9 Correct 435 ms 39416 KB Output is correct
10 Correct 437 ms 38216 KB Output is correct
11 Correct 363 ms 38656 KB Output is correct
12 Correct 363 ms 39208 KB Output is correct
13 Correct 357 ms 39536 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 5 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 720 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 481 ms 37760 KB Output is correct
23 Correct 476 ms 38592 KB Output is correct
24 Correct 469 ms 38944 KB Output is correct
25 Correct 464 ms 38048 KB Output is correct
26 Correct 457 ms 39144 KB Output is correct
27 Correct 362 ms 38824 KB Output is correct
28 Correct 362 ms 38652 KB Output is correct
29 Correct 431 ms 39252 KB Output is correct
30 Correct 435 ms 39416 KB Output is correct
31 Correct 437 ms 38216 KB Output is correct
32 Correct 363 ms 38656 KB Output is correct
33 Correct 363 ms 39208 KB Output is correct
34 Correct 357 ms 39536 KB Output is correct
35 Correct 451 ms 37916 KB Output is correct
36 Correct 478 ms 39512 KB Output is correct
37 Correct 463 ms 39972 KB Output is correct
38 Correct 453 ms 39904 KB Output is correct
39 Correct 464 ms 39996 KB Output is correct
40 Correct 491 ms 39792 KB Output is correct
41 Correct 462 ms 39736 KB Output is correct
42 Correct 535 ms 39856 KB Output is correct
43 Correct 469 ms 39516 KB Output is correct
44 Correct 466 ms 39508 KB Output is correct
45 Correct 522 ms 39396 KB Output is correct
46 Correct 471 ms 40660 KB Output is correct
47 Correct 356 ms 39252 KB Output is correct
48 Correct 331 ms 39508 KB Output is correct
49 Correct 441 ms 38740 KB Output is correct
50 Correct 357 ms 39364 KB Output is correct
51 Correct 361 ms 39372 KB Output is correct
52 Correct 416 ms 39448 KB Output is correct