oj.uz

Submission #924676

# Submission time Handle Problem Language Result Execution time Memory
924676 2024-02-09T12:11:25 Z Baizho Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 247 ms 17024 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
 #pragma GCC optimize("Ofast,unroll-loops,fast-math")
 #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, q, s, t, a[N];
long long ans = 0, u[N * 4];

long long val(long long x, long long y, int p) {
	if(p == n + 1) return 0;
	if(x < y) return 1LL * (x - y) * s;
	return 1LL * (x - y) * t;
}

void update(int v, int tl, int tr, int l, int r, int x) {
	if(tl > r || l > tr) return;
	if(l <= tl && tr <= r) {
		u[v] += x;
		return;
	}
	int tm = (tl + tr) / 2;
	update(v + v, tl, tm, l, r, x);
	update(v + v + 1, tm + 1, tr, l, r, x);
}

long long get(int v, int tl, int tr, int p) {
	if(tl == tr) return u[v];
	int tm = (tl + tr) / 2;
	if(p <= tm) return get(v + v, tl, tm, p) + u[v];
	else return get(v + v + 1, tm + 1, tr, p) + u[v];
}


void Baizho() {
	cin>>n>>q>>s>>t;
	for(int i = 0; i <= n; i ++) {
		cin>>a[i];
		update(1, 0, n, i, i, a[i]);
	}
	for(int i = 0; i < n; i ++) {
		ans += val(a[i], a[i + 1], i + 1);
	}
	while(q --) {
		int l, r, x; cin>>l>>r>>x;
		long long v1 = get(1, 0, n, l - 1), v2 = get(1, 0, n, l), v3 = get(1, 0, n, r), v4 = get(1, 0, n, r + 1);
		ans = ans - val(v1, v2, l) - val(v3, v4, r + 1) + val(v1, v2 + x, l) + val(v3 + x, v4, r + 1);
		update(1, 0, n, l, r, x);
		cout<<ans<<"\n";
	}
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

foehn_phenomena.cpp: In function 'void Freopen(std::string)':
foehn_phenomena.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2512 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2532 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 14112 KB Output is correct
2 Correct 244 ms 14936 KB Output is correct
3 Correct 228 ms 15444 KB Output is correct
4 Correct 247 ms 14788 KB Output is correct
5 Correct 242 ms 16164 KB Output is correct
6 Correct 119 ms 14860 KB Output is correct
7 Correct 119 ms 14932 KB Output is correct
8 Correct 228 ms 15900 KB Output is correct
9 Correct 215 ms 16044 KB Output is correct
10 Correct 207 ms 14744 KB Output is correct
11 Correct 119 ms 14624 KB Output is correct
12 Correct 122 ms 15412 KB Output is correct
13 Correct 122 ms 15952 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2512 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2532 KB Output is correct
6 Correct 2 ms 2392 KB Output is correct
7 Correct 2 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 231 ms 14112 KB Output is correct
23 Correct 244 ms 14936 KB Output is correct
24 Correct 228 ms 15444 KB Output is correct
25 Correct 247 ms 14788 KB Output is correct
26 Correct 242 ms 16164 KB Output is correct
27 Correct 119 ms 14860 KB Output is correct
28 Correct 119 ms 14932 KB Output is correct
29 Correct 228 ms 15900 KB Output is correct
30 Correct 215 ms 16044 KB Output is correct
31 Correct 207 ms 14744 KB Output is correct
32 Correct 119 ms 14624 KB Output is correct
33 Correct 122 ms 15412 KB Output is correct
34 Correct 122 ms 15952 KB Output is correct
35 Correct 223 ms 14324 KB Output is correct
36 Correct 226 ms 15712 KB Output is correct
37 Correct 227 ms 16468 KB Output is correct
38 Correct 226 ms 16300 KB Output is correct
39 Correct 240 ms 16468 KB Output is correct
40 Correct 226 ms 16464 KB Output is correct
41 Correct 221 ms 16256 KB Output is correct
42 Correct 221 ms 16300 KB Output is correct
43 Correct 236 ms 15552 KB Output is correct
44 Correct 223 ms 16112 KB Output is correct
45 Correct 233 ms 15956 KB Output is correct
46 Correct 224 ms 17024 KB Output is correct
47 Correct 121 ms 15504 KB Output is correct
48 Correct 119 ms 15544 KB Output is correct
49 Correct 220 ms 14860 KB Output is correct
50 Correct 119 ms 15340 KB Output is correct
51 Correct 122 ms 15696 KB Output is correct
52 Correct 129 ms 15440 KB Output is correct