oj.uz

답안 #636905

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
636905 2022-08-30T12:58:12 Z ghostwriter Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 121 ms 12364 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int N = 2e5 + 5;
int n, q, s, t, a[N];
ll d[N], ans = 0;
#define cost(d) (d > 0? -1LL * s * d : -1LL * t * d)
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> n >> q >> s >> t;
    FOR(i, 0, n) cin >> a[i];
    FOR(i, 1, n) d[i] = a[i] - a[i - 1];
    FOR(i, 1, n) ans += cost(d[i]);
    WHILE(q--) {
    	int l, r, x;
    	cin >> l >> r >> x;
    	ans -= cost(d[l]);
    	d[l] += x;
    	ans += cost(d[l]);
    	if (r < n) {
    		ans -= cost(d[r + 1]);
    		d[r + 1] -= x;
    		ans += cost(d[r + 1]);
    	}
    	cout << ans << '\n';
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
foehn_phenomena.cpp:45:5: note: in expansion of macro 'FOR'
   45 |     FOR(i, 0, n) cin >> a[i];
      |     ^~~
foehn_phenomena.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
foehn_phenomena.cpp:46:5: note: in expansion of macro 'FOR'
   46 |     FOR(i, 1, n) d[i] = a[i] - a[i - 1];
      |     ^~~
foehn_phenomena.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
foehn_phenomena.cpp:47:5: note: in expansion of macro 'FOR'
   47 |     FOR(i, 1, n) ans += cost(d[i]);
      |     ^~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 9464 KB Output is correct
2 Correct 107 ms 10056 KB Output is correct
3 Correct 93 ms 10596 KB Output is correct
4 Correct 86 ms 10032 KB Output is correct
5 Correct 107 ms 11148 KB Output is correct
6 Correct 77 ms 10276 KB Output is correct
7 Correct 80 ms 10248 KB Output is correct
8 Correct 95 ms 11088 KB Output is correct
9 Correct 98 ms 11468 KB Output is correct
10 Correct 93 ms 10116 KB Output is correct
11 Correct 82 ms 10140 KB Output is correct
12 Correct 78 ms 10836 KB Output is correct
13 Correct 76 ms 11080 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 392 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 99 ms 9464 KB Output is correct
23 Correct 107 ms 10056 KB Output is correct
24 Correct 93 ms 10596 KB Output is correct
25 Correct 86 ms 10032 KB Output is correct
26 Correct 107 ms 11148 KB Output is correct
27 Correct 77 ms 10276 KB Output is correct
28 Correct 80 ms 10248 KB Output is correct
29 Correct 95 ms 11088 KB Output is correct
30 Correct 98 ms 11468 KB Output is correct
31 Correct 93 ms 10116 KB Output is correct
32 Correct 82 ms 10140 KB Output is correct
33 Correct 78 ms 10836 KB Output is correct
34 Correct 76 ms 11080 KB Output is correct
35 Correct 98 ms 9652 KB Output is correct
36 Correct 95 ms 11080 KB Output is correct
37 Correct 96 ms 11776 KB Output is correct
38 Correct 121 ms 11584 KB Output is correct
39 Correct 98 ms 11652 KB Output is correct
40 Correct 89 ms 11672 KB Output is correct
41 Correct 94 ms 11396 KB Output is correct
42 Correct 104 ms 11592 KB Output is correct
43 Correct 93 ms 10844 KB Output is correct
44 Correct 99 ms 11272 KB Output is correct
45 Correct 93 ms 11212 KB Output is correct
46 Correct 99 ms 12364 KB Output is correct
47 Correct 80 ms 10836 KB Output is correct
48 Correct 80 ms 10896 KB Output is correct
49 Correct 79 ms 9896 KB Output is correct
50 Correct 96 ms 10780 KB Output is correct
51 Correct 77 ms 11084 KB Output is correct
52 Correct 81 ms 10848 KB Output is correct