oj.uz

Submission #34091

# Submission time Handle Problem Language Result Execution time Memory
34091 2017-11-07T08:18:03 Z nickyrio Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 149 ms 5144 KB 
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<=b ; i++)
#define FORD(i, a, b) for (int i = a; i>=b; i--)
#define REP(i, a) for (int i = 0; i<a; i++)
#define N 100100
#define pp pair<int, int>
#define IO cin.tie(NULL);cout.tie(NULL);
template<typename T> inline void read(T &x) {
    char c;
    bool neg = false;
    while (!isdigit(c = getchar()) && c != '-');
    x = 0;
    if (c == '-') {
        neg = true;
        c = getchar();
    }
    do {
        x = x * 10 + c - '0';
    } while (isdigit(c = getchar()));
    if (neg) x = -x;
}
template<typename T> inline void write(T x) {
    if (x < 0) {
        putchar('-');
        write(-x);
        return;
    }
    if (x < 10) {
        putchar(char(x + 48));
    }
    else {
        write(x/10);
        putchar(char(48 + x%10));
    }
}
template<typename T> inline void writeln(T x) {
    write(x);
    putchar('\n');
}
using namespace std;

int n, q;
vector<long long> a, b;
long long neg, po, s, t;

void Up(int u, int x) {
    if (b[u] < 0) neg -= b[u];
    else po -= b[u];
    b[u] += x;
    if (b[u] < 0) neg += b[u];
    else po += b[u];
}

int main() {
    IO;
    read(n);read(q);read(s);read(t);
    a.resize(n + 5);
    b.resize(n + 5);
    REP(i, n + 1) read(a[i]);
    FOR(i, 1, n) b[i] = 0;
    int l, r, x;
    neg = po = 0;
    FOR(i, 1, n) Up(i, a[i] - a[i - 1]);
    while (q--) {
        read(l);read(r);read(x);
        Up(l, x);
        if (r != n) Up(r + 1, -x);
        long long ans = -neg * t - po * s;
        writeln(ans);
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 5144 KB Output is correct
2 Correct 123 ms 5144 KB Output is correct
3 Correct 116 ms 5144 KB Output is correct
4 Correct 116 ms 5144 KB Output is correct
5 Correct 119 ms 5144 KB Output is correct
6 Correct 99 ms 5144 KB Output is correct
7 Correct 93 ms 5144 KB Output is correct
8 Correct 123 ms 5144 KB Output is correct
9 Correct 113 ms 5144 KB Output is correct
10 Correct 116 ms 5144 KB Output is correct
11 Correct 99 ms 5144 KB Output is correct
12 Correct 79 ms 5144 KB Output is correct
13 Correct 99 ms 5144 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2016 KB Output is correct
2 Correct 0 ms 2016 KB Output is correct
3 Correct 0 ms 2016 KB Output is correct
4 Correct 0 ms 2016 KB Output is correct
5 Correct 0 ms 2016 KB Output is correct
6 Correct 0 ms 2016 KB Output is correct
7 Correct 0 ms 2016 KB Output is correct
8 Correct 0 ms 2016 KB Output is correct
9 Correct 0 ms 2016 KB Output is correct
10 Correct 0 ms 2016 KB Output is correct
11 Correct 0 ms 2016 KB Output is correct
12 Correct 0 ms 2016 KB Output is correct
13 Correct 0 ms 2016 KB Output is correct
14 Correct 0 ms 2016 KB Output is correct
15 Correct 0 ms 2016 KB Output is correct
16 Correct 0 ms 2016 KB Output is correct
17 Correct 0 ms 2016 KB Output is correct
18 Correct 0 ms 2016 KB Output is correct
19 Correct 0 ms 2016 KB Output is correct
20 Correct 0 ms 2016 KB Output is correct
21 Correct 0 ms 2016 KB Output is correct
22 Correct 123 ms 5144 KB Output is correct
23 Correct 123 ms 5144 KB Output is correct
24 Correct 116 ms 5144 KB Output is correct
25 Correct 116 ms 5144 KB Output is correct
26 Correct 119 ms 5144 KB Output is correct
27 Correct 99 ms 5144 KB Output is correct
28 Correct 93 ms 5144 KB Output is correct
29 Correct 123 ms 5144 KB Output is correct
30 Correct 113 ms 5144 KB Output is correct
31 Correct 116 ms 5144 KB Output is correct
32 Correct 99 ms 5144 KB Output is correct
33 Correct 79 ms 5144 KB Output is correct
34 Correct 99 ms 5144 KB Output is correct
35 Correct 86 ms 5144 KB Output is correct
36 Correct 116 ms 5144 KB Output is correct
37 Correct 139 ms 5144 KB Output is correct
38 Correct 129 ms 5144 KB Output is correct
39 Correct 119 ms 5144 KB Output is correct
40 Correct 119 ms 5144 KB Output is correct
41 Correct 149 ms 5144 KB Output is correct
42 Correct 133 ms 5144 KB Output is correct
43 Correct 126 ms 5144 KB Output is correct
44 Correct 143 ms 5144 KB Output is correct
45 Correct 113 ms 5144 KB Output is correct
46 Correct 146 ms 5144 KB Output is correct
47 Correct 116 ms 5144 KB Output is correct
48 Correct 106 ms 5144 KB Output is correct
49 Correct 123 ms 5144 KB Output is correct
50 Correct 86 ms 5144 KB Output is correct
51 Correct 93 ms 5144 KB Output is correct
52 Correct 86 ms 5144 KB Output is correct