oj.uz

Submission #54401

# Submission time Handle Problem Language Result Execution time Memory
54401 2018-07-03T10:16:53 Z bogdan10bos Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 260 ms 168976 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef long long LL;

int N, Q, S, T;
int v[200005];
LL s[200005];


int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    scanf("%d%d", &N, &Q);
    scanf("%d%d", &S, &T);
    for(int i = 0; i <= N; i++) scanf("%d", &v[i]);
    LL ans = 0LL;
    for(int i = 1; i <= N; i++)
    {
        s[i] = v[i - 1] - v[i];
        ans += s[i] * (s[i] >= 0 ? T : S);
    }
    for(int i = 1; i <= Q; i++)
    {
        int st, dr, x;
        scanf("%d%d%d", &st, &dr, &x);

        if(st != 0)
        {
            ans -= s[st] * (s[st] > 0 ? T : S);
            s[st] -= x;
            ans += s[st] * (s[st] > 0 ? T : S);
        }

        if(dr != N)
        {
            dr++;
            ans -= s[dr] * (s[dr] > 0 ? T : S);
            s[dr] += x;
            ans += s[dr] * (s[dr] > 0 ? T : S);
        }

        printf("%lld\n", ans);
    }


    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &Q);
     ~~~~~^~~~~~~~~~~~~~~~
foehn_phenomena.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &S, &T);
     ~~~~~^~~~~~~~~~~~~~~~
foehn_phenomena.cpp:23:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i <= N; i++) scanf("%d", &v[i]);
                                 ~~~~~^~~~~~~~~~~~~
foehn_phenomena.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &st, &dr, &x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 3 ms 824 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 904 KB Output is correct
8 Correct 3 ms 952 KB Output is correct
9 Correct 4 ms 1000 KB Output is correct
10 Correct 3 ms 1048 KB Output is correct
11 Correct 3 ms 1096 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct
13 Correct 3 ms 1308 KB Output is correct
14 Correct 3 ms 1308 KB Output is correct
15 Correct 3 ms 1336 KB Output is correct
16 Correct 3 ms 1524 KB Output is correct
17 Correct 3 ms 1548 KB Output is correct
18 Correct 3 ms 1592 KB Output is correct
19 Correct 2 ms 1592 KB Output is correct
20 Correct 2 ms 1640 KB Output is correct
21 Correct 2 ms 1644 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 10748 KB Output is correct
2 Correct 159 ms 16780 KB Output is correct
3 Correct 161 ms 22776 KB Output is correct
4 Correct 148 ms 27608 KB Output is correct
5 Correct 173 ms 34528 KB Output is correct
6 Correct 143 ms 39416 KB Output is correct
7 Correct 140 ms 44028 KB Output is correct
8 Correct 162 ms 49540 KB Output is correct
9 Correct 168 ms 55412 KB Output is correct
10 Correct 160 ms 59656 KB Output is correct
11 Correct 113 ms 65184 KB Output is correct
12 Correct 122 ms 70424 KB Output is correct
13 Correct 128 ms 75432 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Correct 3 ms 824 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 904 KB Output is correct
8 Correct 3 ms 952 KB Output is correct
9 Correct 4 ms 1000 KB Output is correct
10 Correct 3 ms 1048 KB Output is correct
11 Correct 3 ms 1096 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct
13 Correct 3 ms 1308 KB Output is correct
14 Correct 3 ms 1308 KB Output is correct
15 Correct 3 ms 1336 KB Output is correct
16 Correct 3 ms 1524 KB Output is correct
17 Correct 3 ms 1548 KB Output is correct
18 Correct 3 ms 1592 KB Output is correct
19 Correct 2 ms 1592 KB Output is correct
20 Correct 2 ms 1640 KB Output is correct
21 Correct 2 ms 1644 KB Output is correct
22 Correct 161 ms 10748 KB Output is correct
23 Correct 159 ms 16780 KB Output is correct
24 Correct 161 ms 22776 KB Output is correct
25 Correct 148 ms 27608 KB Output is correct
26 Correct 173 ms 34528 KB Output is correct
27 Correct 143 ms 39416 KB Output is correct
28 Correct 140 ms 44028 KB Output is correct
29 Correct 162 ms 49540 KB Output is correct
30 Correct 168 ms 55412 KB Output is correct
31 Correct 160 ms 59656 KB Output is correct
32 Correct 113 ms 65184 KB Output is correct
33 Correct 122 ms 70424 KB Output is correct
34 Correct 128 ms 75432 KB Output is correct
35 Correct 161 ms 78816 KB Output is correct
36 Correct 163 ms 85536 KB Output is correct
37 Correct 169 ms 91840 KB Output is correct
38 Correct 260 ms 97004 KB Output is correct
39 Correct 183 ms 102292 KB Output is correct
40 Correct 178 ms 107832 KB Output is correct
41 Correct 175 ms 113056 KB Output is correct
42 Correct 183 ms 118540 KB Output is correct
43 Correct 166 ms 123332 KB Output is correct
44 Correct 195 ms 129044 KB Output is correct
45 Correct 161 ms 134492 KB Output is correct
46 Correct 157 ms 141228 KB Output is correct
47 Correct 142 ms 145856 KB Output is correct
48 Correct 131 ms 150520 KB Output is correct
49 Correct 144 ms 154012 KB Output is correct
50 Correct 118 ms 159244 KB Output is correct
51 Correct 134 ms 164152 KB Output is correct
52 Correct 127 ms 168976 KB Output is correct