oj.uz

답안 #910097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
910097 2024-01-17T22:03:43 Z raphaelp Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 515 ms 13072 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long N, Q, U, D;
    cin >> N >> Q >> U >> D;
    vector<long long> alt(N + 1);
    vector<long long> diff(N + 1);
    long long sum = 0;
    for (long long i = 0; i <= N; i++)
    {
        cin >> alt[i];
        if (i == 0)
            continue;
        diff[i] = alt[i] - alt[i - 1];
        if (diff[i] > 0)
            sum -= diff[i] * U;
        else
            sum -= diff[i] * D;
    }
    for (long long i = 0; i < Q; i++)
    {
        long long l, r, x;
        cin >> l >> r >> x;
        if (x > 0)
        {
            if (diff[l] < 0)
            {
                sum -= min(abs(diff[l]), x) * D;
                if (abs(diff[l]) < x)
                    sum -= (x + diff[l]) * U;
            }
            else
                sum -= x * U;
            diff[l] += x;
            if (r != N)
            {
                if (diff[r + 1] > 0)
                {
                    sum += min(diff[r + 1], x) * U;
                    if (diff[r + 1] < x)
                        sum += (x - diff[r + 1]) * D;
                }
                else
                    sum += x * D;
                diff[r + 1] -= x;
            }
        }
        else
        {
            if (diff[l] > 0)
            {
                sum += min(diff[l], abs(x)) * U;
                if (diff[l] < abs(x))
                    sum += (abs(x) - diff[l]) * D;
            }
            else
                sum += abs(x) * D;
            diff[l] += x;
            if (r != N)
            {
                if (diff[r + 1] < 0)
                {
                    sum -= min(abs(diff[r + 1]), abs(x)) * D;
                    if (abs(diff[r + 1]) < abs(x))
                        sum -= (abs(x) + diff[r + 1]) * U;
                }
                else
                    sum -= abs(x) * U;
                diff[r + 1] -= x;
            }
        }
        cout << sum << '\n';
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 440 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 417 ms 4828 KB Output is correct
2 Correct 428 ms 11352 KB Output is correct
3 Correct 421 ms 11600 KB Output is correct
4 Correct 450 ms 10972 KB Output is correct
5 Correct 515 ms 12112 KB Output is correct
6 Correct 404 ms 11088 KB Output is correct
7 Correct 402 ms 11088 KB Output is correct
8 Correct 423 ms 11996 KB Output is correct
9 Correct 411 ms 12132 KB Output is correct
10 Correct 432 ms 11176 KB Output is correct
11 Correct 386 ms 10832 KB Output is correct
12 Correct 402 ms 11600 KB Output is correct
13 Correct 414 ms 11924 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 5 ms 440 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 4 ms 508 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 4 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 417 ms 4828 KB Output is correct
23 Correct 428 ms 11352 KB Output is correct
24 Correct 421 ms 11600 KB Output is correct
25 Correct 450 ms 10972 KB Output is correct
26 Correct 515 ms 12112 KB Output is correct
27 Correct 404 ms 11088 KB Output is correct
28 Correct 402 ms 11088 KB Output is correct
29 Correct 423 ms 11996 KB Output is correct
30 Correct 411 ms 12132 KB Output is correct
31 Correct 432 ms 11176 KB Output is correct
32 Correct 386 ms 10832 KB Output is correct
33 Correct 402 ms 11600 KB Output is correct
34 Correct 414 ms 11924 KB Output is correct
35 Correct 426 ms 10576 KB Output is correct
36 Correct 416 ms 11856 KB Output is correct
37 Correct 428 ms 12564 KB Output is correct
38 Correct 422 ms 12368 KB Output is correct
39 Correct 439 ms 12524 KB Output is correct
40 Correct 435 ms 12512 KB Output is correct
41 Correct 422 ms 12212 KB Output is correct
42 Correct 419 ms 12368 KB Output is correct
43 Correct 423 ms 11820 KB Output is correct
44 Correct 415 ms 12112 KB Output is correct
45 Correct 414 ms 12112 KB Output is correct
46 Correct 504 ms 13072 KB Output is correct
47 Correct 398 ms 11616 KB Output is correct
48 Correct 395 ms 11620 KB Output is correct
49 Correct 406 ms 10988 KB Output is correct
50 Correct 391 ms 11604 KB Output is correct
51 Correct 407 ms 12048 KB Output is correct
52 Correct 412 ms 11796 KB Output is correct