oj.uz

Submission #977419

# Submission time Handle Problem Language Result Execution time Memory
977419 2024-05-07T23:21:35 Z thegamercoder19 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 559 ms 37352 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;
};
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;
    if (a.sf >= b.pf) res.tc += a.sf - b.pf;
    else res.sc += b.pf - a.sf;
    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];
    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);
    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:120:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:121:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 559 ms 34668 KB Output is correct
2 Correct 483 ms 35384 KB Output is correct
3 Correct 456 ms 35764 KB Output is correct
4 Correct 467 ms 34980 KB Output is correct
5 Correct 463 ms 36272 KB Output is correct
6 Correct 355 ms 36268 KB Output is correct
7 Correct 364 ms 36288 KB Output is correct
8 Correct 424 ms 36020 KB Output is correct
9 Correct 465 ms 36540 KB Output is correct
10 Correct 434 ms 35156 KB Output is correct
11 Correct 358 ms 36180 KB Output is correct
12 Correct 355 ms 36652 KB Output is correct
13 Correct 349 ms 37000 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 604 KB Output is correct
5 Correct 4 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 816 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 804 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 4 ms 816 KB Output is correct
16 Correct 4 ms 604 KB Output is correct
17 Correct 4 ms 604 KB Output is correct
18 Correct 4 ms 824 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 559 ms 34668 KB Output is correct
23 Correct 483 ms 35384 KB Output is correct
24 Correct 456 ms 35764 KB Output is correct
25 Correct 467 ms 34980 KB Output is correct
26 Correct 463 ms 36272 KB Output is correct
27 Correct 355 ms 36268 KB Output is correct
28 Correct 364 ms 36288 KB Output is correct
29 Correct 424 ms 36020 KB Output is correct
30 Correct 465 ms 36540 KB Output is correct
31 Correct 434 ms 35156 KB Output is correct
32 Correct 358 ms 36180 KB Output is correct
33 Correct 355 ms 36652 KB Output is correct
34 Correct 349 ms 37000 KB Output is correct
35 Correct 459 ms 34748 KB Output is correct
36 Correct 462 ms 36396 KB Output is correct
37 Correct 533 ms 36948 KB Output is correct
38 Correct 464 ms 36868 KB Output is correct
39 Correct 477 ms 37352 KB Output is correct
40 Correct 524 ms 36944 KB Output is correct
41 Correct 478 ms 36948 KB Output is correct
42 Correct 462 ms 36652 KB Output is correct
43 Correct 504 ms 36096 KB Output is correct
44 Correct 482 ms 36312 KB Output is correct
45 Correct 446 ms 36284 KB Output is correct
46 Correct 459 ms 36860 KB Output is correct
47 Correct 356 ms 36824 KB Output is correct
48 Correct 344 ms 36892 KB Output is correct
49 Correct 436 ms 36008 KB Output is correct
50 Correct 402 ms 36684 KB Output is correct
51 Correct 360 ms 36948 KB Output is correct
52 Correct 406 ms 36780 KB Output is correct