oj.uz

Submission #224197

# Submission time Handle Problem Language Result Execution time Memory
224197 2020-04-17T12:18:59 Z Ruxandra985 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 380 ms 15728 KB 
#include <bits/stdc++.h>

using namespace std;

long long aint[800010] , v[200010];

void build (long long nod , long long st , long long dr){
    long long mid = (st + dr)/2;

    if (st == dr){
        aint[nod] = v[st];
        return;
    }

    build (2 * nod , st , mid);
    build (2 * nod + 1 , mid + 1 , dr);

}

void update (long long nod , long long st , long long dr , long long l , long long r , long long val){
    long long mid = (st + dr)/2;

    if (l <= st && dr <= r){
        aint[nod] += val;
        return;
    }

    aint[2 * nod] += aint[nod];
    aint[2 * nod + 1] += aint[nod];

    aint[nod] = 0;

    if (l <= mid)
        update (2 * nod , st , mid , l , r , val);
    if (mid + 1 <= r)
        update (2 * nod + 1 , mid + 1 , dr , l , r , val);


}

long long query (long long nod , long long st , long long dr , long long p){

    long long mid = (st + dr)/2;

    if (st == dr){
        return aint[nod];
    }

    aint[2 * nod] += aint[nod];
    aint[2 * nod + 1] += aint[nod];

    aint[nod] = 0;

    if (p <= mid)
        return query (2 * nod , st , mid , p);
    else
        return query (2 * nod + 1 , mid + 1 , dr , p);


}

int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    long long n , i , q , s , t , sol , p1 , p2 , q1 , q2 , l , r , x;
    fscanf (fin,"%lld%lld%lld%lld",&n,&q,&s,&t);
    /// temp scade cu s / unitate cand alt creste
    /// temp creste cu t / unitate cand alt scade

    for (i = 0 ; i <= n ; i++){
        fscanf (fin,"%lld",&v[i]);
    }

    build (1 , 0 , n);

    sol = 0;

    for (i = 0 ; i < n ; i++){
        if (v[i] < v[i + 1])
            sol = sol - s * (v[i + 1] - v[i]);
        else sol = sol + t * (v[i] - v[i + 1]);
    }

    for (;q;q--){
        fscanf (fin,"%lld%lld%lld",&l,&r,&x);

        p1 = query (1 , 0 , n , l - 1);
        p2 = query (1 , 0 , n , l);

        if (p1 < p2)
            sol = sol + s * (p2 - p1);
        else sol = sol - t * (p1 - p2);

        q1 = query (1 , 0 , n , r);
        q2 = query (1 , 0 , n , r + 1);

        if (r != n){

            if (q1 < q2)
                sol = sol + s * (q2 - q1);
            else sol = sol - t * (q1 - q2);

        }

        update (1 , 0 , n , l , r , x);

        p2 += x;
        q1 += x;

        if (p1 < p2)
            sol = sol - s * (p2 - p1);
        else sol = sol + t * (p1 - p2);


        if (r != n){

            if (q1 < q2)
                sol = sol - s * (q2 - q1);
            else sol = sol + t * (q1 - q2);

        }


        fprintf (fout,"%lld\n",sol);

    }

    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:67:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%lld%lld%lld%lld",&n,&q,&s,&t);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:72:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%lld",&v[i]);
         ~~~~~~~^~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:86:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%lld%lld%lld",&l,&r,&x);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 7548 KB Output is correct
2 Correct 341 ms 8148 KB Output is correct
3 Correct 343 ms 8796 KB Output is correct
4 Correct 380 ms 13432 KB Output is correct
5 Correct 314 ms 14712 KB Output is correct
6 Correct 276 ms 12664 KB Output is correct
7 Correct 268 ms 12664 KB Output is correct
8 Correct 343 ms 14400 KB Output is correct
9 Correct 332 ms 14712 KB Output is correct
10 Correct 297 ms 13436 KB Output is correct
11 Correct 208 ms 12664 KB Output is correct
12 Correct 256 ms 13308 KB Output is correct
13 Correct 245 ms 13560 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 333 ms 7548 KB Output is correct
23 Correct 341 ms 8148 KB Output is correct
24 Correct 343 ms 8796 KB Output is correct
25 Correct 380 ms 13432 KB Output is correct
26 Correct 314 ms 14712 KB Output is correct
27 Correct 276 ms 12664 KB Output is correct
28 Correct 268 ms 12664 KB Output is correct
29 Correct 343 ms 14400 KB Output is correct
30 Correct 332 ms 14712 KB Output is correct
31 Correct 297 ms 13436 KB Output is correct
32 Correct 208 ms 12664 KB Output is correct
33 Correct 256 ms 13308 KB Output is correct
34 Correct 245 ms 13560 KB Output is correct
35 Correct 366 ms 13048 KB Output is correct
36 Correct 346 ms 14380 KB Output is correct
37 Correct 345 ms 15352 KB Output is correct
38 Correct 345 ms 15100 KB Output is correct
39 Correct 362 ms 15176 KB Output is correct
40 Correct 323 ms 14968 KB Output is correct
41 Correct 326 ms 14840 KB Output is correct
42 Correct 335 ms 15096 KB Output is correct
43 Correct 370 ms 14328 KB Output is correct
44 Correct 324 ms 14584 KB Output is correct
45 Correct 316 ms 14728 KB Output is correct
46 Correct 313 ms 15728 KB Output is correct
47 Correct 264 ms 13432 KB Output is correct
48 Correct 196 ms 13304 KB Output is correct
49 Correct 360 ms 13304 KB Output is correct
50 Correct 197 ms 13048 KB Output is correct
51 Correct 259 ms 13432 KB Output is correct
52 Correct 291 ms 13304 KB Output is correct