oj.uz

Submission #634387

# Submission time Handle Problem Language Result Execution time Memory
634387 2022-08-24T10:47:08 Z xynex Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 414 ms 19804 KB 
/**
  * Author: Tenjin
  * Created: 19.08.2022 01:29
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N1 = 1e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

ll A[N1], N;
ll t[N1], z[N1];
void build(int tl = 0, int tr = N, int v = 1) {
  if(tl == tr) {
    t[v] = A[tl];
    return;
  }
  int mid = (tl + tr) >> 1;
  build(tl, mid, v * 2); build(mid + 1, tr, v * 2 + 1);
  t[v] = t[v * 2] + t[v * 2 + 1];
}
void push(int tl, int tr, int v) {
  if(tl != tr) {
    z[v * 2] += z[v];
    z[v * 2 + 1] += z[v];
  }
  t[v] += (tr - tl + 1) * z[v];
  z[v] = 0;
}
void upd(int l, int r, int ind, int tl = 0, int tr = N, int v = 1) {
  push(tl, tr, v);
  if(tl > r || tr < l) return;
  if(tl >= l && tr <= r) {
    z[v] += ind;
    push(tl, tr, v);
    return;
  }
  int mid = (tl + tr) >> 1;
  upd(l, r, ind, tl, mid, v * 2); upd(l, r, ind, mid + 1, tr, v * 2 + 1);
  t[v] = t[v * 2] + t[v * 2 + 1];
}
ll get(int pos, int tl = 0, int tr = N, int v = 1) {
  push(tl, tr, v);
  if(tl == tr) return t[v];
  int mid = (tl + tr) >> 1;
  if(mid >= pos) return get(pos, tl, mid, v * 2);
  else return get(pos, mid + 1, tr, v * 2 + 1);
}
void solve() {
  ll Q, S, T; read(N, Q, S, T);
  for(int i = 0; i <= N; ++i) read(A[i]);
  ll ans = 0;
  for(int i = 1; i <= N; ++i) {
    if(A[i] >= A[i - 1]) ans -= S * (A[i] - A[i - 1]);
    else ans += T * (A[i - 1] - A[i]);
  }
  build();
  while(Q--) {
    ll l, r, X; read(l, r, X);
    A[l] = get(l);
    A[l - 1] = get(l - 1);
    A[r] = get(r);
    if(r < N) A[r + 1] = get(r + 1);
    if(A[l] >= A[l - 1]) ans += S * (A[l] - A[l - 1]);
    else ans -= T * (A[l - 1] - A[l]);
    if(r < N) {
      if(A[r + 1] >= A[r]) ans += S * (A[r + 1] - A[r]);
      else ans -= T * (A[r] - A[r + 1]);
    }
    upd(l, r, X);
    A[l] = get(l);
    A[l - 1] = get(l - 1);
    A[r] = get(r);
    if(r < N) A[r + 1] = get(r + 1);
    if(A[l] >= A[l - 1]) ans -= S * (A[l] - A[l - 1]);
    else ans += T * (A[l - 1] - A[l]);
    if(r < N) {
      if(A[r + 1] >= A[r]) ans -= S * (A[r + 1] - A[r]);
      else ans += T * (A[r] - A[r + 1]);
    }
    print(ans);
  }
}

int main() {
  //freop("");
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
 // read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'void freop(std::string)':
foehn_phenomena.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 392 KB Output is correct
7 Correct 4 ms 472 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 2 ms 392 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 11460 KB Output is correct
2 Correct 383 ms 12176 KB Output is correct
3 Correct 377 ms 12708 KB Output is correct
4 Correct 381 ms 17500 KB Output is correct
5 Correct 390 ms 18668 KB Output is correct
6 Correct 267 ms 13584 KB Output is correct
7 Correct 267 ms 13632 KB Output is correct
8 Correct 332 ms 18564 KB Output is correct
9 Correct 364 ms 18832 KB Output is correct
10 Correct 332 ms 17524 KB Output is correct
11 Correct 213 ms 13516 KB Output is correct
12 Correct 273 ms 14284 KB Output is correct
13 Correct 291 ms 14504 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 3 ms 468 KB Output is correct
6 Correct 3 ms 392 KB Output is correct
7 Correct 4 ms 472 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 2 ms 392 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 402 ms 11460 KB Output is correct
23 Correct 383 ms 12176 KB Output is correct
24 Correct 377 ms 12708 KB Output is correct
25 Correct 381 ms 17500 KB Output is correct
26 Correct 390 ms 18668 KB Output is correct
27 Correct 267 ms 13584 KB Output is correct
28 Correct 267 ms 13632 KB Output is correct
29 Correct 332 ms 18564 KB Output is correct
30 Correct 364 ms 18832 KB Output is correct
31 Correct 332 ms 17524 KB Output is correct
32 Correct 213 ms 13516 KB Output is correct
33 Correct 273 ms 14284 KB Output is correct
34 Correct 291 ms 14504 KB Output is correct
35 Correct 398 ms 17000 KB Output is correct
36 Correct 387 ms 18484 KB Output is correct
37 Correct 408 ms 19332 KB Output is correct
38 Correct 387 ms 19164 KB Output is correct
39 Correct 389 ms 19184 KB Output is correct
40 Correct 388 ms 19020 KB Output is correct
41 Correct 414 ms 18916 KB Output is correct
42 Correct 395 ms 19020 KB Output is correct
43 Correct 382 ms 18312 KB Output is correct
44 Correct 403 ms 18764 KB Output is correct
45 Correct 391 ms 18736 KB Output is correct
46 Correct 395 ms 19804 KB Output is correct
47 Correct 270 ms 14292 KB Output is correct
48 Correct 207 ms 14284 KB Output is correct
49 Correct 368 ms 17336 KB Output is correct
50 Correct 217 ms 14144 KB Output is correct
51 Correct 262 ms 14488 KB Output is correct
52 Correct 363 ms 14308 KB Output is correct