oj.uz

Submission #57881

# Submission time Handle Problem Language Result Execution time Memory
57881 2018-07-16T13:24:29 Z BrunoPloumhans Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 294 ms 161916 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define D(x) //cout << #x << ": " << x << endl

template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{ ";
  for(const T& t : v)
    os << t << ", ";
  return os << "}";
}

template<typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& v) {
  return os << "{ " << v.first << ", " << v.second << " }";
}

int ft1[200002];
int n, s, t;
// point query, range update
int query1(int i) {
  int sum = 0;
  for(; i > 0; i -= (i&(-i)))
    sum += ft1[i];
  return sum;
}

void update1(int i, int w) {
  for(; i <= n+1; i+=(i&(-i)))
    ft1[i] += w;
}

void update1(int a, int b, int w) {
  update1(a, w);
  update1(b+1, -w);
}

int sm = 0;

int diff(int a, int b) {
  return a > b ? (a-b)*t : (a-b)*s;
}

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int q;
  cin >> n >> q >> s >> t;

  int prev;
  for(int i = 0; i <= n; ++i) {
    int a;
    cin >> a;
    update1(i+1, i+1, a);
    if(i != 0) {
      sm += diff(prev, a);
      D(diff(prev, a));
    }
    prev = a;
  }
  D(sm);

  for(int i = 0; i < q; ++i) {
    int l, r, x;
    cin >> l >> r >> x;
    int a1 = query1(l), a2 = query1(l+1);
    D(sm);
    sm -= diff(a1, a2);
    sm += diff(a1, a2+x);
    D(sm);
    if(r != n) {
      int b1 = query1(r+1), b2 = query1(r+2);
      sm -= diff(b1, b2);
      sm += diff(b1+x, b2);
      D(sm);
    }
    update1(l+1, r+1, x);
    /*    for(int i = 0; i <= n; ++i)
      cout << query1(i+1) << " ";
      cout << "\n";*/
    D("next");
    cout << sm << "\n";
  }

  return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 548 KB Output is correct
2 Correct 3 ms 664 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 4 ms 816 KB Output is correct
5 Correct 4 ms 968 KB Output is correct
6 Correct 4 ms 1268 KB Output is correct
7 Correct 4 ms 1268 KB Output is correct
8 Correct 4 ms 1268 KB Output is correct
9 Correct 5 ms 1268 KB Output is correct
10 Correct 5 ms 1268 KB Output is correct
11 Correct 5 ms 1424 KB Output is correct
12 Correct 4 ms 1424 KB Output is correct
13 Correct 4 ms 1504 KB Output is correct
14 Correct 6 ms 1600 KB Output is correct
15 Correct 6 ms 1644 KB Output is correct
16 Correct 4 ms 1644 KB Output is correct
17 Correct 5 ms 1668 KB Output is correct
18 Correct 5 ms 1708 KB Output is correct
19 Correct 2 ms 1760 KB Output is correct
20 Correct 3 ms 1760 KB Output is correct
21 Correct 3 ms 1888 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 10132 KB Output is correct
2 Correct 183 ms 16128 KB Output is correct
3 Correct 211 ms 22060 KB Output is correct
4 Correct 244 ms 26928 KB Output is correct
5 Correct 172 ms 33708 KB Output is correct
6 Correct 150 ms 38844 KB Output is correct
7 Correct 166 ms 43388 KB Output is correct
8 Correct 222 ms 48884 KB Output is correct
9 Correct 220 ms 54620 KB Output is correct
10 Correct 238 ms 58976 KB Output is correct
11 Correct 136 ms 64428 KB Output is correct
12 Correct 168 ms 69708 KB Output is correct
13 Correct 150 ms 74764 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 548 KB Output is correct
2 Correct 3 ms 664 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 4 ms 816 KB Output is correct
5 Correct 4 ms 968 KB Output is correct
6 Correct 4 ms 1268 KB Output is correct
7 Correct 4 ms 1268 KB Output is correct
8 Correct 4 ms 1268 KB Output is correct
9 Correct 5 ms 1268 KB Output is correct
10 Correct 5 ms 1268 KB Output is correct
11 Correct 5 ms 1424 KB Output is correct
12 Correct 4 ms 1424 KB Output is correct
13 Correct 4 ms 1504 KB Output is correct
14 Correct 6 ms 1600 KB Output is correct
15 Correct 6 ms 1644 KB Output is correct
16 Correct 4 ms 1644 KB Output is correct
17 Correct 5 ms 1668 KB Output is correct
18 Correct 5 ms 1708 KB Output is correct
19 Correct 2 ms 1760 KB Output is correct
20 Correct 3 ms 1760 KB Output is correct
21 Correct 3 ms 1888 KB Output is correct
22 Correct 237 ms 10132 KB Output is correct
23 Correct 183 ms 16128 KB Output is correct
24 Correct 211 ms 22060 KB Output is correct
25 Correct 244 ms 26928 KB Output is correct
26 Correct 172 ms 33708 KB Output is correct
27 Correct 150 ms 38844 KB Output is correct
28 Correct 166 ms 43388 KB Output is correct
29 Correct 222 ms 48884 KB Output is correct
30 Correct 220 ms 54620 KB Output is correct
31 Correct 238 ms 58976 KB Output is correct
32 Correct 136 ms 64428 KB Output is correct
33 Correct 168 ms 69708 KB Output is correct
34 Correct 150 ms 74764 KB Output is correct
35 Correct 213 ms 78056 KB Output is correct
36 Correct 229 ms 84832 KB Output is correct
37 Correct 216 ms 91084 KB Output is correct
38 Correct 256 ms 96336 KB Output is correct
39 Correct 233 ms 101660 KB Output is correct
40 Correct 278 ms 107052 KB Output is correct
41 Correct 214 ms 112060 KB Output is correct
42 Correct 242 ms 116972 KB Output is correct
43 Correct 193 ms 121412 KB Output is correct
44 Correct 221 ms 126448 KB Output is correct
45 Correct 237 ms 131176 KB Output is correct
46 Correct 294 ms 137656 KB Output is correct
47 Correct 178 ms 142268 KB Output is correct
48 Correct 151 ms 146716 KB Output is correct
49 Correct 212 ms 149352 KB Output is correct
50 Correct 151 ms 153952 KB Output is correct
51 Correct 155 ms 158040 KB Output is correct
52 Correct 178 ms 161916 KB Output is correct