oj.uz

Submission #126687

# Submission time Handle Problem Language Result Execution time Memory
126687 2019-07-08T09:14:49 Z DodgeBallMan Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 224 ms 13220 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;
long long fen[N], va, a[N], s, t, sum;
int n, q, l, r;

long long query( int idx ) {
    long long ret = 0;
    for( int i = idx ; i > 0 ; i -= ( i & -i ) ) ret += fen[i];
    return ret;
}

void up( int idx, long long va ) {
    for( int i = idx ; i <= N ; i += ( i & -i ) ) fen[i] += va;
}

long long cal( int l, int r ) {
    long long a = query( l ), b = query( r );
    if( a < b ) return ( a - b ) * s;
    else return ( a - b ) * t;
}

int main()
{
    scanf("%d %d %lld %lld",&n,&q,&s,&t);
    for( int i = 1 ; i <= n + 1 ; i++ ) {
        scanf("%lld",&a[i]);
        up( i, a[i] ), up( i + 1, -a[i] );
    }
    for( int i = 1 ; i <= n ; i++ ) sum += cal( i, i + 1 );
    while( q-- ) {
        scanf("%d %d %lld",&l,&r,&va);
        l++, r++;
        sum -= ( ( l == 1 ? 0 : cal( l - 1, l ) ) + ( r == n + 1 ? 0 : cal( r, r + 1 ) ) );
        up( l, va ), up( r + 1, -va );
        sum += ( ( l == 1 ? 0 : cal( l - 1, l ) ) + ( r == n + 1 ? 0 : cal( r, r + 1 ) ) );
        printf("%lld\n",sum);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %lld %lld",&n,&q,&s,&t);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:29: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("%d %d %lld",&l,&r,&va);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 424 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 4 ms 460 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 4 ms 380 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 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 209 ms 9356 KB Output is correct
2 Correct 209 ms 10872 KB Output is correct
3 Correct 211 ms 11512 KB Output is correct
4 Correct 195 ms 10964 KB Output is correct
5 Correct 202 ms 12032 KB Output is correct
6 Correct 154 ms 11172 KB Output is correct
7 Correct 159 ms 11128 KB Output is correct
8 Correct 204 ms 11876 KB Output is correct
9 Correct 205 ms 12152 KB Output is correct
10 Correct 199 ms 10984 KB Output is correct
11 Correct 143 ms 11000 KB Output is correct
12 Correct 146 ms 11592 KB Output is correct
13 Correct 174 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 4 ms 424 KB Output is correct
6 Correct 4 ms 380 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 3 ms 436 KB Output is correct
14 Correct 4 ms 460 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 4 ms 380 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 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 209 ms 9356 KB Output is correct
23 Correct 209 ms 10872 KB Output is correct
24 Correct 211 ms 11512 KB Output is correct
25 Correct 195 ms 10964 KB Output is correct
26 Correct 202 ms 12032 KB Output is correct
27 Correct 154 ms 11172 KB Output is correct
28 Correct 159 ms 11128 KB Output is correct
29 Correct 204 ms 11876 KB Output is correct
30 Correct 205 ms 12152 KB Output is correct
31 Correct 199 ms 10984 KB Output is correct
32 Correct 143 ms 11000 KB Output is correct
33 Correct 146 ms 11592 KB Output is correct
34 Correct 174 ms 11896 KB Output is correct
35 Correct 210 ms 10472 KB Output is correct
36 Correct 216 ms 11896 KB Output is correct
37 Correct 218 ms 12664 KB Output is correct
38 Correct 217 ms 12408 KB Output is correct
39 Correct 217 ms 12572 KB Output is correct
40 Correct 220 ms 12536 KB Output is correct
41 Correct 222 ms 12280 KB Output is correct
42 Correct 222 ms 12460 KB Output is correct
43 Correct 219 ms 11640 KB Output is correct
44 Correct 224 ms 12092 KB Output is correct
45 Correct 208 ms 12200 KB Output is correct
46 Correct 206 ms 13220 KB Output is correct
47 Correct 156 ms 11640 KB Output is correct
48 Correct 172 ms 11768 KB Output is correct
49 Correct 192 ms 10744 KB Output is correct
50 Correct 146 ms 11488 KB Output is correct
51 Correct 147 ms 11896 KB Output is correct
52 Correct 155 ms 11692 KB Output is correct