oj.uz

Submission #92381

# Submission time Handle Problem Language Result Execution time Memory
92381 2019-01-02T17:18:01 Z karma Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 145 ms 11552 KB 
#include<bits/stdc++.h>
#define For(i, a, b)  for(int i = a, _b = b; i <= _b; ++i)
#define Ford(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define FileName      "test"
#define ll            long long
#define ld            long double
#define ull           unsigned long long
#define Print(x)      cerr << #x << "is " << x << '\n';
#define pb            push_back
#define X             first
#define Y             second
//#define Karma

using namespace std;

template<typename T> inline void Cin(T &x)
{
    char c;
    T sign = 1;
    x = 0;
    for (c = getchar(); c < '0' || c > '9'; c = getchar())
        if (c == '-') sign = -1;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
    x *= sign;
}
template <typename T> inline void Out(T x) {if(x > 9) Out(x / 10); putchar(x % 10 + '0');}
template <typename T> inline void Cout(T x, char c) {if(x < 0) putchar('-'); x = abs(x); Out(x); putchar(c);}
template <typename T, typename... Args> inline void Cin(T& a, Args&... args) {Cin(a);Cin(args...);}
template <typename T, typename... Args> inline void Cout(T a, char c, Args... args) {Cout(a, c);Cout(args...);}

typedef pair<int, int> pii;
typedef pair<ll, int> plli;
const int N = 1e6 + 7;

int n, Q, l, r;
ll s, t, pre, a[N], x, pos, neg;

void Enter()
{
     Cin(n, Q, s, t, pre);
     pos = neg = 0;
     For(i, 1, n)
     {
         Cin(x), a[i] = x - pre, pre = x;
         if(a[i] >= 0) pos += a[i];
         else neg += a[i];
     }
}

void Add(int p, ll v)
{
     if(p > n) return;
     if(a[p] < 0) neg -= a[p];
     else pos -= a[p];
     a[p] += v;
     if(a[p] < 0) neg += a[p];
     else pos += a[p];
}

void Solve()
{
     while(Q --)
     {
         Cin(l, r, x);
         Add(l, x), Add(r + 1, -x);
         cout << - neg * t - pos * s << '\n';
     }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
#ifdef Karma
    freopen(FileName".inp", "r", stdin);
    freopen(FileName".out", "w", stdout);
#endif // Karma

    Enter();
    Solve();

    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 8844 KB Output is correct
2 Correct 77 ms 9316 KB Output is correct
3 Correct 82 ms 9936 KB Output is correct
4 Correct 71 ms 9336 KB Output is correct
5 Correct 115 ms 10512 KB Output is correct
6 Correct 145 ms 9468 KB Output is correct
7 Correct 63 ms 9464 KB Output is correct
8 Correct 87 ms 10232 KB Output is correct
9 Correct 78 ms 10616 KB Output is correct
10 Correct 84 ms 9336 KB Output is correct
11 Correct 59 ms 9404 KB Output is correct
12 Correct 62 ms 10056 KB Output is correct
13 Correct 63 ms 10360 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 3 ms 404 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 75 ms 8844 KB Output is correct
23 Correct 77 ms 9316 KB Output is correct
24 Correct 82 ms 9936 KB Output is correct
25 Correct 71 ms 9336 KB Output is correct
26 Correct 115 ms 10512 KB Output is correct
27 Correct 145 ms 9468 KB Output is correct
28 Correct 63 ms 9464 KB Output is correct
29 Correct 87 ms 10232 KB Output is correct
30 Correct 78 ms 10616 KB Output is correct
31 Correct 84 ms 9336 KB Output is correct
32 Correct 59 ms 9404 KB Output is correct
33 Correct 62 ms 10056 KB Output is correct
34 Correct 63 ms 10360 KB Output is correct
35 Correct 84 ms 8848 KB Output is correct
36 Correct 88 ms 10384 KB Output is correct
37 Correct 80 ms 11128 KB Output is correct
38 Correct 79 ms 10808 KB Output is correct
39 Correct 81 ms 10828 KB Output is correct
40 Correct 80 ms 10972 KB Output is correct
41 Correct 80 ms 10616 KB Output is correct
42 Correct 81 ms 10844 KB Output is correct
43 Correct 78 ms 10016 KB Output is correct
44 Correct 80 ms 10616 KB Output is correct
45 Correct 81 ms 10512 KB Output is correct
46 Correct 80 ms 11552 KB Output is correct
47 Correct 65 ms 10128 KB Output is correct
48 Correct 62 ms 10104 KB Output is correct
49 Correct 65 ms 9080 KB Output is correct
50 Correct 60 ms 9888 KB Output is correct
51 Correct 62 ms 10364 KB Output is correct
52 Correct 60 ms 10104 KB Output is correct