답안 #129326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129326 2019-07-12T03:23:19 Z AuldLangSyne Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
224 ms 7416 KB
#include <bits/stdc++.h>
#define ll long long
#define f(i, a, b) for(ll i = a; i <= b; ++i)
#define ff(i, a, b) for(ll i = a; i < b; ++i)
#define F(i, a, b) for(ll i = a; i >= b; --i)
#define FF(i, a, b) for(ll i = a; i > b; --i)
#define x first
#define y second
#define X real()
#define Y imag()
using namespace std;
typedef complex<ll> P;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;

const ll N = 2e5+7;
ll n, m, r, s, u, v, o, f[N], a[N], ans = 0;

signed main(){
//	freopen("PERFECT1.inp","r",stdin);
//	freopen("PERFECT1.out","w",stdout);
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> m >> r >> s;
	f(i,0,n){
		cin >> a[i];
		if(i){
			f[i] = a[i]-a[i-1];
			ans -= f[i] > 0 ? f[i]*r : f[i]*s;	
		}
	}
	
	while(m--){
		cin >> u >> v >> o;
		ans += f[u] > 0 ? f[u]*r : f[u]*s;	
		f[u] += o;
		ans -= f[u] > 0 ? f[u]*r : f[u]*s;	
		if(v != n){
			ans += f[v+1] > 0 ? f[v+1]*r : f[v+1]*s;
			f[v+1] -= o; 
			ans -= f[v+1] > 0 ? f[v+1]*r : f[v+1]*s;		
		}
		cout << ans <<"\n";
	}
}

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 134 ms 4856 KB Output is correct
2 Correct 134 ms 5520 KB Output is correct
3 Correct 154 ms 6264 KB Output is correct
4 Correct 134 ms 5240 KB Output is correct
5 Correct 224 ms 6012 KB Output is correct
6 Correct 112 ms 6452 KB Output is correct
7 Correct 112 ms 6452 KB Output is correct
8 Correct 153 ms 6316 KB Output is correct
9 Correct 141 ms 6696 KB Output is correct
10 Correct 135 ms 5368 KB Output is correct
11 Correct 110 ms 6448 KB Output is correct
12 Correct 110 ms 6904 KB Output is correct
13 Correct 111 ms 7288 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 134 ms 4856 KB Output is correct
23 Correct 134 ms 5520 KB Output is correct
24 Correct 154 ms 6264 KB Output is correct
25 Correct 134 ms 5240 KB Output is correct
26 Correct 224 ms 6012 KB Output is correct
27 Correct 112 ms 6452 KB Output is correct
28 Correct 112 ms 6452 KB Output is correct
29 Correct 153 ms 6316 KB Output is correct
30 Correct 141 ms 6696 KB Output is correct
31 Correct 135 ms 5368 KB Output is correct
32 Correct 110 ms 6448 KB Output is correct
33 Correct 110 ms 6904 KB Output is correct
34 Correct 111 ms 7288 KB Output is correct
35 Correct 132 ms 5032 KB Output is correct
36 Correct 140 ms 6492 KB Output is correct
37 Correct 144 ms 7416 KB Output is correct
38 Correct 142 ms 7032 KB Output is correct
39 Correct 143 ms 7088 KB Output is correct
40 Correct 139 ms 7032 KB Output is correct
41 Correct 140 ms 6892 KB Output is correct
42 Correct 144 ms 7036 KB Output is correct
43 Correct 160 ms 6264 KB Output is correct
44 Correct 142 ms 6676 KB Output is correct
45 Correct 134 ms 6520 KB Output is correct
46 Correct 139 ms 7164 KB Output is correct
47 Correct 114 ms 7160 KB Output is correct
48 Correct 112 ms 7288 KB Output is correct
49 Correct 134 ms 6408 KB Output is correct
50 Correct 108 ms 7044 KB Output is correct
51 Correct 112 ms 7004 KB Output is correct
52 Correct 113 ms 7084 KB Output is correct