oj.uz

Submission #153273

# Submission time Handle Problem Language Result Execution time Memory
153273 2019-09-13T07:12:31 Z Hideo Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 188 ms 16464 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define vi vector < int >
#define pi pair < int, int >

const int N = 1e6 + 7;
const int INF = 1e9 + 7;

vector < ll > vec;
ll a[N], val[N], sum[N], ans;
ll n, q, s, t;

main(){
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++){
        scanf("%lld", &a[i]);
        if (i)
            val[i] = a[i - 1] - a[i];
        sum[i] = val[i];
        if (sum[i] > 0)
            sum[i] *= t;
        else
            sum[i] *= s;
        ans += sum[i];
    }
    while (q--){
        ll l, r, x;
        scanf("%lld%lld%lld", &l, &r, &x);
        r++;
        val[l] -= x;
        if (r <= n)
            val[r] += x;
        ans -= (sum[l] + sum[r]);
        sum[l] = val[l]; sum[r] = val[r];
        if (sum[l] > 0)
            sum[l] *= t;
        else
            sum[l] *= s;

        if (sum[r] > 0)
            sum[r] *= t;
        else
            sum[r] *= s;
        ans += (sum[l] + sum[r]);
        vec.pb(ans);
    }
    for (ll to : vec)
        printf("%lld\n", to);
}

Compilation message

foehn_phenomena.cpp:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
         ~~~~~^~~~~~~~~~~~~~~
foehn_phenomena.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld", &l, &r, &x);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 508 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 3 ms 508 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 4 ms 508 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 504 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 157 ms 13668 KB Output is correct
2 Correct 162 ms 14180 KB Output is correct
3 Correct 162 ms 14824 KB Output is correct
4 Correct 148 ms 14140 KB Output is correct
5 Correct 151 ms 15260 KB Output is correct
6 Correct 128 ms 14508 KB Output is correct
7 Correct 129 ms 14352 KB Output is correct
8 Correct 165 ms 15076 KB Output is correct
9 Correct 165 ms 15460 KB Output is correct
10 Correct 159 ms 14180 KB Output is correct
11 Correct 112 ms 14332 KB Output is correct
12 Correct 128 ms 15092 KB Output is correct
13 Correct 121 ms 15204 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 508 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 3 ms 508 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 4 ms 508 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 504 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 157 ms 13668 KB Output is correct
23 Correct 162 ms 14180 KB Output is correct
24 Correct 162 ms 14824 KB Output is correct
25 Correct 148 ms 14140 KB Output is correct
26 Correct 151 ms 15260 KB Output is correct
27 Correct 128 ms 14508 KB Output is correct
28 Correct 129 ms 14352 KB Output is correct
29 Correct 165 ms 15076 KB Output is correct
30 Correct 165 ms 15460 KB Output is correct
31 Correct 159 ms 14180 KB Output is correct
32 Correct 112 ms 14332 KB Output is correct
33 Correct 128 ms 15092 KB Output is correct
34 Correct 121 ms 15204 KB Output is correct
35 Correct 157 ms 13812 KB Output is correct
36 Correct 168 ms 15160 KB Output is correct
37 Correct 181 ms 16056 KB Output is correct
38 Correct 170 ms 15888 KB Output is correct
39 Correct 168 ms 15696 KB Output is correct
40 Correct 169 ms 15716 KB Output is correct
41 Correct 173 ms 15716 KB Output is correct
42 Correct 188 ms 15844 KB Output is correct
43 Correct 179 ms 14968 KB Output is correct
44 Correct 172 ms 15460 KB Output is correct
45 Correct 170 ms 15332 KB Output is correct
46 Correct 160 ms 16464 KB Output is correct
47 Correct 134 ms 14948 KB Output is correct
48 Correct 132 ms 15104 KB Output is correct
49 Correct 140 ms 13928 KB Output is correct
50 Correct 113 ms 14860 KB Output is correct
51 Correct 124 ms 15376 KB Output is correct
52 Correct 121 ms 15004 KB Output is correct