oj.uz

Submission #698396

# Submission time Handle Problem Language Result Execution time Memory
698396 2023-02-13T10:58:35 Z Richem Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 610 ms 13200 KB 
#include <iostream>
#define int long long
using namespace std;

const int MAX_NOMBRE = 2e5+42, MAX_FEUILLE = (1 << 18);

int nbNombre, nbReq, valMoins, valPlus;

int ab[MAX_FEUILLE*2] = {0};

int tempVent = 0;

int modifTemp(int val1, int val2) {
    return ((min((int)0, val1 - val2) * valMoins) + max((int)0, val1 - val2) * valPlus);
}

void input() {
    cin >> nbNombre >> nbReq >> valMoins >> valPlus;
    nbNombre++;

    int preced = 0;
    for(int cur = 0; cur < nbNombre; cur++) {
        cin >> ab[cur + MAX_FEUILLE];
        int valCur = ab[cur + MAX_FEUILLE];

        tempVent += modifTemp(preced, valCur);

        preced = valCur;
    }
}

int getVal(int pos) {
    pos += MAX_FEUILLE;

    int total = 0;

    for(; pos > 0; pos /= 2) {
        total += ab[pos];
    }

    return total;
}

void ajoutInter(int deb, int fin, int val) {
    deb += MAX_FEUILLE, fin += MAX_FEUILLE;

    while(deb <= fin) {
        if(deb % 2 == 1) {
            ab[deb++] += val;
        }
        if(fin % 2 == 0) {
            ab[fin--] += val;
        }

        deb /= 2; fin /= 2;
    }
}

signed main() {
    input();

    for(int req = 0; req < nbReq; req++) {
        int deb, fin, val;
        cin >> deb >> fin >> val;

        for(auto modif : {-1, 1}) {
            if(deb > 0) {
                tempVent += (modifTemp(getVal(deb-1), getVal(deb)) * modif);
            }
            if(fin+1 < nbNombre) {
                tempVent += (modifTemp(getVal(fin), getVal(fin+1)) * modif);
            }

            if(modif == -1) {
                ajoutInter(deb, fin, val);
            }
        }    

        cout << tempVent << endl;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 6 ms 456 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 6 ms 448 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 6 ms 320 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 5 ms 452 KB Output is correct
16 Correct 5 ms 320 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 10204 KB Output is correct
2 Correct 561 ms 10904 KB Output is correct
3 Correct 569 ms 11552 KB Output is correct
4 Correct 610 ms 10800 KB Output is correct
5 Correct 575 ms 11980 KB Output is correct
6 Correct 541 ms 9628 KB Output is correct
7 Correct 497 ms 9488 KB Output is correct
8 Correct 529 ms 11832 KB Output is correct
9 Correct 573 ms 12132 KB Output is correct
10 Correct 551 ms 10860 KB Output is correct
11 Correct 461 ms 9336 KB Output is correct
12 Correct 473 ms 10164 KB Output is correct
13 Correct 462 ms 10472 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 6 ms 456 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 7 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 6 ms 448 KB Output is correct
8 Correct 6 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 6 ms 340 KB Output is correct
12 Correct 6 ms 468 KB Output is correct
13 Correct 6 ms 320 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 5 ms 452 KB Output is correct
16 Correct 5 ms 320 KB Output is correct
17 Correct 5 ms 340 KB Output is correct
18 Correct 6 ms 340 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 597 ms 10204 KB Output is correct
23 Correct 561 ms 10904 KB Output is correct
24 Correct 569 ms 11552 KB Output is correct
25 Correct 610 ms 10800 KB Output is correct
26 Correct 575 ms 11980 KB Output is correct
27 Correct 541 ms 9628 KB Output is correct
28 Correct 497 ms 9488 KB Output is correct
29 Correct 529 ms 11832 KB Output is correct
30 Correct 573 ms 12132 KB Output is correct
31 Correct 551 ms 10860 KB Output is correct
32 Correct 461 ms 9336 KB Output is correct
33 Correct 473 ms 10164 KB Output is correct
34 Correct 462 ms 10472 KB Output is correct
35 Correct 534 ms 10332 KB Output is correct
36 Correct 534 ms 12072 KB Output is correct
37 Correct 532 ms 12684 KB Output is correct
38 Correct 543 ms 12408 KB Output is correct
39 Correct 548 ms 12500 KB Output is correct
40 Correct 542 ms 12536 KB Output is correct
41 Correct 532 ms 12320 KB Output is correct
42 Correct 534 ms 12332 KB Output is correct
43 Correct 543 ms 11724 KB Output is correct
44 Correct 535 ms 12024 KB Output is correct
45 Correct 553 ms 12188 KB Output is correct
46 Correct 545 ms 13200 KB Output is correct
47 Correct 464 ms 10060 KB Output is correct
48 Correct 469 ms 10100 KB Output is correct
49 Correct 503 ms 10956 KB Output is correct
50 Correct 466 ms 9860 KB Output is correct
51 Correct 480 ms 10316 KB Output is correct
52 Correct 481 ms 10176 KB Output is correct