oj.uz

Submission #781591

# Submission time Handle Problem Language Result Execution time Memory
781591 2023-07-13T08:23:00 Z RecursiveCo Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 98 ms 13192 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long

signed main() {
    improvePerformance;
    //getTest;

    //eachTest {
        get(n);
        get(q);
        get(s);
        get(t);
        vector<int> pos;
        forto(n + 1, i) {
            get(x);
            pos.push_back(x);
        }
        vector<int> delta;
        forto(n, i) delta.push_back(pos[i + 1] - pos[i]);
        int ans = 0;
        forto(n, i) {
            if (delta[i] >= 0) ans -= s * delta[i];
            else ans -= t * delta[i];
        }
        forto(q, i) {
            get(l);
            get(r);
            l--;
            r--;
            get(x);
            ans += delta[l] >= 0? s * delta[l]: t * delta[l];
            delta[l] += x;
            ans -= delta[l] >= 0? s * delta[l]: t * delta[l];
            if (r != n - 1) {
                ans += delta[r + 1] >= 0? s * delta[r + 1]: t * delta[r + 1];
                delta[r + 1] -= x;
                ans -= delta[r + 1] >= 0? s * delta[r + 1]: t * delta[r + 1];
            }
            out(ans);
            out("\n");
        }
        //out("\n");
    //}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:25:9: note: in expansion of macro 'get'
   25 |         get(n);
      |         ^~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'q' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:26:9: note: in expansion of macro 'get'
   26 |         get(q);
      |         ^~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 's' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:27:9: note: in expansion of macro 'get'
   27 |         get(s);
      |         ^~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 't' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:28:9: note: in expansion of macro 'get'
   28 |         get(t);
      |         ^~~
foehn_phenomena.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
foehn_phenomena.cpp:30:9: note: in expansion of macro 'forto'
   30 |         forto(n + 1, i) {
      |         ^~~~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:31:13: note: in expansion of macro 'get'
   31 |             get(x);
      |             ^~~
foehn_phenomena.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
foehn_phenomena.cpp:35:9: note: in expansion of macro 'forto'
   35 |         forto(n, i) delta.push_back(pos[i + 1] - pos[i]);
      |         ^~~~~
foehn_phenomena.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
foehn_phenomena.cpp:37:9: note: in expansion of macro 'forto'
   37 |         forto(n, i) {
      |         ^~~~~
foehn_phenomena.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
foehn_phenomena.cpp:41:9: note: in expansion of macro 'forto'
   41 |         forto(q, i) {
      |         ^~~~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'l' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:42:13: note: in expansion of macro 'get'
   42 |             get(l);
      |             ^~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'r' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:43:13: note: in expansion of macro 'get'
   43 |             get(r);
      |             ^~~
foehn_phenomena.cpp:10:23: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
foehn_phenomena.cpp:46:13: note: in expansion of macro 'get'
   46 |             get(x);
      |             ^~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 9948 KB Output is correct
2 Correct 78 ms 11016 KB Output is correct
3 Correct 77 ms 11580 KB Output is correct
4 Correct 71 ms 10936 KB Output is correct
5 Correct 88 ms 12164 KB Output is correct
6 Correct 66 ms 11120 KB Output is correct
7 Correct 65 ms 11076 KB Output is correct
8 Correct 79 ms 11984 KB Output is correct
9 Correct 87 ms 12288 KB Output is correct
10 Correct 76 ms 10936 KB Output is correct
11 Correct 66 ms 11080 KB Output is correct
12 Correct 65 ms 11720 KB Output is correct
13 Correct 75 ms 12100 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 380 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 82 ms 9948 KB Output is correct
23 Correct 78 ms 11016 KB Output is correct
24 Correct 77 ms 11580 KB Output is correct
25 Correct 71 ms 10936 KB Output is correct
26 Correct 88 ms 12164 KB Output is correct
27 Correct 66 ms 11120 KB Output is correct
28 Correct 65 ms 11076 KB Output is correct
29 Correct 79 ms 11984 KB Output is correct
30 Correct 87 ms 12288 KB Output is correct
31 Correct 76 ms 10936 KB Output is correct
32 Correct 66 ms 11080 KB Output is correct
33 Correct 65 ms 11720 KB Output is correct
34 Correct 75 ms 12100 KB Output is correct
35 Correct 87 ms 10476 KB Output is correct
36 Correct 83 ms 11996 KB Output is correct
37 Correct 79 ms 12684 KB Output is correct
38 Correct 84 ms 12604 KB Output is correct
39 Correct 79 ms 12596 KB Output is correct
40 Correct 90 ms 12524 KB Output is correct
41 Correct 78 ms 12340 KB Output is correct
42 Correct 79 ms 12460 KB Output is correct
43 Correct 93 ms 11768 KB Output is correct
44 Correct 98 ms 12128 KB Output is correct
45 Correct 92 ms 12148 KB Output is correct
46 Correct 77 ms 13192 KB Output is correct
47 Correct 69 ms 11804 KB Output is correct
48 Correct 76 ms 11808 KB Output is correct
49 Correct 69 ms 10792 KB Output is correct
50 Correct 63 ms 11672 KB Output is correct
51 Correct 64 ms 12032 KB Output is correct
52 Correct 72 ms 11800 KB Output is correct