oj.uz

Submission #419714

# Submission time Handle Problem Language Result Execution time Memory
419714 2021-06-07T11:50:23 Z arayi Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 756 ms 22300 KB 
//Arayi
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cassert>
#include <chrono>
#include <random>
#include <complex>

#define fr first
#define sc second
#define MP make_pair
#define ad push_back
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
#define j1 jigglypuff
#define ld long double
#define itn int
#define pir pair<int, int>
#define all(x) (x).begin(), (x).end()
#define str string
#define enl endl
#define en endl
#define cd complex<long double>
#define vcd vector<cd>
#define vii vector<int>
#define vlli vector<lli>
using namespace std;

lli gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
ld dist(ld x, ld y1, ld x2, ld y2)
{
    return sqrt((x - x2) * (x - x2) + (y1 - y2) * (y1 - y2));
}
lli S(lli a)
{
    return (a * (a + 1LL)) / 2;
}
mt19937 rnd(363542);
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 0, -1, 0, 1, -1, -1, 1, 1, 0 };
int dy[] = { -1, 0, 1, 0, -1, 1, -1, 1, 0 };


const int N = 1e6 + 30;
const lli mod = 1e9 - 1;
const ld pi = acos(-1);
const int T = 550;

lli bp(lli a, lli b = mod - 2LL)
{
    lli ret = 1;
    while (b)
    {
        if (b & 1) ret *= a, ret %= mod;
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return ret;
}
ostream& operator<<(ostream& c, pir a)
{
    c << a.fr << " " << a.sc;
    return c;
}
template<class T>
void maxi(T& a, T b)
{
    a = max(a, b);
}
template <class T>
void mini(T& a, T b)
{
    a = min(a, b);
}


int n, q;
lli s1, t1, a, b;
lli t[4*N], flg[4*N];
void push(int nd)
{
    flg[nd * 2] += flg[nd];
    flg[nd * 2 + 1] += flg[nd];
    t[nd] += flg[nd];
    flg[nd] = 0;
}
void upd(int l, int r, int v, int nl = 0, int nr = n , int nd = 1)
{
    push(nd);
    if(l > nr || r < nl) return;
    if(l == nl && r == nr)
    {
        flg[nd] += v;
        push(nd);
        return;
    }
    int mid = (nl + nr)/2;
    upd(l, min(mid, r), v, nl, mid, nd * 2);
    upd(max(mid + 1, l), r, v, mid + 1, nr, nd * 2 + 1);
    t[nd] = t[nd * 2] + t[nd* 2 + 1];
}
lli qry(int q, int l = 0, int r = n, int nd = 1)
{
    push(nd);
    if(l > q || r < q) return 0;
    if(l==r) return t[nd];
    int mid = (l + r)/ 2;
    return qry(q, l, mid, nd*2) + qry(q, mid + 1, r, nd * 2 + 1);
}
int main()
{
    fastio;
    cin >> n >> q >> s1 >> t1;
    int x;
    cin >> x;
    upd(0, 0, x);
    for (int i = 0; i < n; i++)
    {
        cin >> x;
        upd(i + 1, i + 1, x);
        int sm = qry(i);
        if(sm >= x) a += sm - x;
        else b += x - sm;
    }
    //cout << a*t1-b*s1 << endl;
    while(q--)
    {
        lli l, r, v;
        cin >> l >> r >> v;
        lli sm = qry(l - 1), s = qry(l);
        if(sm >= s) a -= sm - s;
        else b -= s - sm;
        upd(l, r, v);
        s += v;
        if(sm >= s) a += sm - s;
        else b += s - sm;
        if(r < n)
        {
            sm = qry(r) - v, s = qry(r + 1);
            //cout << sm << " "<< s << endl;
            if(sm >= s) a -= sm - s;
            else b -= s - sm;
            sm += v;
            if(sm >= s) a += sm - s;
            else b += s - sm;
        }
        cout << a*t1 - b*s1 << "\n";
    }
    return 0;
}

/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
    __
  *(><)*
    \/ /
    ||/
  --||
    ||
    /\
   /  \
  /    \

*/

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 725 ms 14032 KB Output is correct
2 Correct 739 ms 14636 KB Output is correct
3 Correct 723 ms 15272 KB Output is correct
4 Correct 720 ms 14408 KB Output is correct
5 Correct 733 ms 15196 KB Output is correct
6 Correct 421 ms 15612 KB Output is correct
7 Correct 416 ms 15620 KB Output is correct
8 Correct 610 ms 15556 KB Output is correct
9 Correct 597 ms 15848 KB Output is correct
10 Correct 605 ms 14792 KB Output is correct
11 Correct 522 ms 15544 KB Output is correct
12 Correct 420 ms 16068 KB Output is correct
13 Correct 416 ms 21144 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 5 ms 460 KB Output is correct
3 Correct 5 ms 448 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 5 ms 460 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 5 ms 460 KB Output is correct
10 Correct 5 ms 460 KB Output is correct
11 Correct 5 ms 460 KB Output is correct
12 Correct 5 ms 460 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 4 ms 460 KB Output is correct
15 Correct 5 ms 460 KB Output is correct
16 Correct 4 ms 460 KB Output is correct
17 Correct 4 ms 464 KB Output is correct
18 Correct 4 ms 460 KB Output is correct
19 Correct 0 ms 288 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 725 ms 14032 KB Output is correct
23 Correct 739 ms 14636 KB Output is correct
24 Correct 723 ms 15272 KB Output is correct
25 Correct 720 ms 14408 KB Output is correct
26 Correct 733 ms 15196 KB Output is correct
27 Correct 421 ms 15612 KB Output is correct
28 Correct 416 ms 15620 KB Output is correct
29 Correct 610 ms 15556 KB Output is correct
30 Correct 597 ms 15848 KB Output is correct
31 Correct 605 ms 14792 KB Output is correct
32 Correct 522 ms 15544 KB Output is correct
33 Correct 420 ms 16068 KB Output is correct
34 Correct 416 ms 21144 KB Output is correct
35 Correct 730 ms 19580 KB Output is correct
36 Correct 732 ms 20952 KB Output is correct
37 Correct 733 ms 21820 KB Output is correct
38 Correct 722 ms 21796 KB Output is correct
39 Correct 715 ms 21688 KB Output is correct
40 Correct 728 ms 21600 KB Output is correct
41 Correct 718 ms 21480 KB Output is correct
42 Correct 756 ms 21572 KB Output is correct
43 Correct 748 ms 20804 KB Output is correct
44 Correct 715 ms 21232 KB Output is correct
45 Correct 744 ms 21256 KB Output is correct
46 Correct 756 ms 22300 KB Output is correct
47 Correct 419 ms 20856 KB Output is correct
48 Correct 496 ms 20912 KB Output is correct
49 Correct 696 ms 19908 KB Output is correct
50 Correct 530 ms 20832 KB Output is correct
51 Correct 432 ms 21060 KB Output is correct
52 Correct 567 ms 20840 KB Output is correct