oj.uz

Submission #977841

# Submission time Handle Problem Language Result Execution time Memory
977841 2024-05-08T11:46:00 Z SmuggingSpun Foehn Phenomena (JOI17_foehn_phenomena) C++14
30 / 100
 113 ms 10620 KB 
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
typedef long long ll;
const int lim = 2e5 + 5;
int n, q, s, t;
ll ans = 0, bit[lim];
void update(int p, int x){
	for(; p <= n; p += p & -p){
		bit[p] += x;
	}
}
ll get(int p){
	ll ans = 0;
	for(; p > 0; p -= p & -p){
		ans += bit[p];
	}
	return ans;
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> q >> s >> t;
	int x;
	cin >> x;
	for(int i = 1, pre = 0; i <= n; i++, pre = x){
		cin >> x;
		update(i, x - pre);
		if(pre < x){
			ans -= 1LL * s * (x - pre);
		}
		else{
			ans += 1LL * t * (pre - x);
		}
	}
	for(int _ = 0; _ < q; _++){
		int l, r, x;
		cin >> l >> r >> x;
		int d = get(l - 1) - get(l);
		if(d < 0){
			ans += 1LL * s * -d;
		}
		else{
			ans -= 1LL * t * d;
		}
		if(r < n){
			if((d = get(r) - get(r + 1)) < 0){
				ans += 1LL * s * -d;
			}
			else{
				ans -= 1LL * t * d;
			}
		}
		update(l, x);
		update(r + 1, -x);
		if((d = get(l - 1) - get(l)) < 0){
			ans -= 1LL * s * -d;
		}
		else{
			ans += 1LL * t * d;
		}
		if(r < n){
			if((d = get(r) - get(r + 1)) < 0){
				ans -= 1LL * s * -d;
			}
			else{
				ans += 1LL * t * d;
			}
		}
		cout << ans << "\n";
	}
}

Compilation message

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 488 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 536 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 8784 KB Output is correct
2 Correct 113 ms 9480 KB Output is correct
3 Correct 105 ms 9808 KB Output is correct
4 Correct 99 ms 9296 KB Output is correct
5 Correct 102 ms 10440 KB Output is correct
6 Correct 70 ms 9528 KB Output is correct
7 Correct 72 ms 9460 KB Output is correct
8 Correct 96 ms 10324 KB Output is correct
9 Correct 105 ms 10620 KB Output is correct
10 Correct 97 ms 9332 KB Output is correct
11 Correct 73 ms 9300 KB Output is correct
12 Incorrect 70 ms 9872 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 488 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 476 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 536 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 104 ms 8784 KB Output is correct
23 Correct 113 ms 9480 KB Output is correct
24 Correct 105 ms 9808 KB Output is correct
25 Correct 99 ms 9296 KB Output is correct
26 Correct 102 ms 10440 KB Output is correct
27 Correct 70 ms 9528 KB Output is correct
28 Correct 72 ms 9460 KB Output is correct
29 Correct 96 ms 10324 KB Output is correct
30 Correct 105 ms 10620 KB Output is correct
31 Correct 97 ms 9332 KB Output is correct
32 Correct 73 ms 9300 KB Output is correct
33 Incorrect 70 ms 9872 KB Output isn't correct
34 Halted 0 ms 0 KB -