oj.uz

답안 #862218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862218 2023-10-17T17:46:49 Z green_gold_dog Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 99 ms 13328 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, q, S, T;
        cin >> n >> q >> S >> T;
        vector<ll> arr(n + 1, 0);
        for (ll i = 0; i <= n; i++) {
                cin >> arr[i];
        }
        vector<ll> ra;
        for (ll i = 1; i <= n; i++) {
                ra.push_back(arr[i] - arr[i - 1]);
        }
        ll ans = 0;
        for (auto i : ra) {
                if (i > 0) {
                        ans += S * i;
                } else {
                        ans += T * i;
                }
        }
        for (ll i = 0; i < q; i++) {
                ll l, r, x;
                cin >> l >> r >> x;
                l--;
                if (ra[l] > 0){
                        ans -= S * ra[l];
                } else {
                        ans -= T * ra[l];
                }
                ra[l] += x;
                if (ra[l] > 0) {
                        ans += S * ra[l];
                } else {
                        ans += T * ra[l];
                }
                if (r != n) {
                        if (ra[r] > 0) {
                                ans -= S * ra[r];
                        } else {
                                ans -= T * ra[r];
                        }
                        ra[r] -= x;
                        if (ra[r] > 0) {
                                ans += S * ra[r];
                        } else {
                                ans += T * ra[r];
                        }
                }
                cout << -ans << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:103:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
foehn_phenomena.cpp:104:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 564 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 480 KB Output is correct
13 Correct 1 ms 560 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 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 91 ms 10444 KB Output is correct
2 Correct 77 ms 11212 KB Output is correct
3 Correct 79 ms 11720 KB Output is correct
4 Correct 74 ms 10964 KB Output is correct
5 Correct 77 ms 12228 KB Output is correct
6 Correct 69 ms 11208 KB Output is correct
7 Correct 69 ms 11288 KB Output is correct
8 Correct 99 ms 11980 KB Output is correct
9 Correct 79 ms 12352 KB Output is correct
10 Correct 78 ms 11028 KB Output is correct
11 Correct 64 ms 11208 KB Output is correct
12 Correct 68 ms 11920 KB Output is correct
13 Correct 65 ms 12148 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 564 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 592 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 480 KB Output is correct
13 Correct 1 ms 560 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 91 ms 10444 KB Output is correct
23 Correct 77 ms 11212 KB Output is correct
24 Correct 79 ms 11720 KB Output is correct
25 Correct 74 ms 10964 KB Output is correct
26 Correct 77 ms 12228 KB Output is correct
27 Correct 69 ms 11208 KB Output is correct
28 Correct 69 ms 11288 KB Output is correct
29 Correct 99 ms 11980 KB Output is correct
30 Correct 79 ms 12352 KB Output is correct
31 Correct 78 ms 11028 KB Output is correct
32 Correct 64 ms 11208 KB Output is correct
33 Correct 68 ms 11920 KB Output is correct
34 Correct 65 ms 12148 KB Output is correct
35 Correct 75 ms 10720 KB Output is correct
36 Correct 79 ms 11980 KB Output is correct
37 Correct 81 ms 12748 KB Output is correct
38 Correct 80 ms 12748 KB Output is correct
39 Correct 82 ms 12692 KB Output is correct
40 Correct 80 ms 12652 KB Output is correct
41 Correct 79 ms 12488 KB Output is correct
42 Correct 80 ms 12584 KB Output is correct
43 Correct 79 ms 11704 KB Output is correct
44 Correct 78 ms 12260 KB Output is correct
45 Correct 75 ms 12236 KB Output is correct
46 Correct 78 ms 13328 KB Output is correct
47 Correct 67 ms 11980 KB Output is correct
48 Correct 68 ms 11976 KB Output is correct
49 Correct 86 ms 10848 KB Output is correct
50 Correct 64 ms 11704 KB Output is correct
51 Correct 69 ms 11996 KB Output is correct
52 Correct 79 ms 11868 KB Output is correct