oj.uz

Submission #994349

# Submission time Handle Problem Language Result Execution time Memory
994349 2024-06-07T12:46:01 Z TgX_2 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 72 ms 13148 KB 
/*-----------------------------
        Author : TgX.2
       10Ti - K28 - CHV
-----------------------------*/

#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i=(a), _b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a), _b=(b);i>=_b;--i)
#define FORC(i,a,b,c) for(int i=(a), _b=(b), _c=(c);i<=_b;i+=_c)
#define FORSq(i,a,b) for(int i=(a), _b=(b);i*i<=_b;++i)
#define FORSt(i,s) for(int i=0, _s=(int)(s.size());i<_s;++i)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pp pop_back()
#define eb emplace_back
#define ers erase
#define ins insert
#define emp empty()
#define rvs reverse

#define BIT(x,i) (((x)>>(i))&1)
#define MASK(i) (1LL<<(i))
#define CNTBIT(x) __builtin_popcountll(x)
#define ODDBIT(x) __builtin_parityll(x)
#define FIRSTBIT(x) __builtin_ctzll(x)

#define len(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define alln(x,n) (x)+1, (x)+1+(n)

#define _ <<" "<<
#define __ << "\n"
#define ___ << " "
#define ____ << "\t"

#define file "temp"
#define ______________TgX______________ main()
#define int long long
#define intmax 1e9
#define intmin -1e9
#define llongmax 1e18
#define llongmin -1e18
#define memo(a, val) memset((a), (val), sizeof((a)))

using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

// int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1};                         // 4 Direction
// int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1};     // 8 Direction
// int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1};   // Knight Direction
// int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1};              // Hexagonal Direction

void fastio() {
    if (fopen(file".inp", "r")) {
        freopen(file".inp", "r", stdin);
        freopen(file".out", "w", stdout);
        freopen(file".debug", "w", stderr);
    }        
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);  
}

template<typename T1, typename T2> bool mini(T1 &a, T2 b)
    {if(a>b) a=b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b)
    {if(a<b) a=b; else return 0; return 1;}
/*-----------------------------*/

const int maxn = 2e5 + 7;
int n, q, s, t, a[maxn], d[maxn];

int f(int id) {
    return -d[id] * (d[id] > 0 ? s : t);
}

void process() {
    cin >> n >> q >> s >> t;
    int ans = 0;
    FOR(i, 0, n) {
        cin >> a[i];
        if (i > 0) {
            d[i] = a[i] - a[i - 1];
            ans += f(i);
        }
    }

    while(q--) {
        int l, r, x; cin >> l >> r >> x;
        ans -= f(l);
        d[l] += x;
        ans += f(l);
        
        if (r < n) {
            ans -= f(r + 1);
            d[r + 1] -= x;
            ans += f(r + 1);
        }

        cout << ans __ ;
    }
}



/*-----------------------------*/
______________TgX______________ {
    auto start = high_resolution_clock::now();
    fastio();
    process();
    auto stop = high_resolution_clock::now();
    auto duration = duration_cast<microseconds>(stop - start);
    cerr << "Time: " << duration.count() << " ms" << endl;  
}


/*==============================+
|INPUT                          |
--------------------------------|

================================+
|OUTPUT                         |
--------------------------------|

===============================*/

Compilation message

foehn_phenomena.cpp:41:41: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   41 | #define ______________TgX______________ main()
      |                                         ^~~~
foehn_phenomena.cpp:118:1: note: in expansion of macro '______________TgX______________'
  118 | ______________TgX______________ {
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp: In function 'void fastio()':
foehn_phenomena.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(file".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(file".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:69:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         freopen(file".debug", "w", stderr);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 10324 KB Output is correct
2 Correct 66 ms 10932 KB Output is correct
3 Correct 65 ms 11464 KB Output is correct
4 Correct 63 ms 11004 KB Output is correct
5 Correct 63 ms 12112 KB Output is correct
6 Correct 57 ms 11132 KB Output is correct
7 Correct 55 ms 11088 KB Output is correct
8 Correct 62 ms 11976 KB Output is correct
9 Correct 69 ms 12152 KB Output is correct
10 Correct 59 ms 10864 KB Output is correct
11 Correct 55 ms 10832 KB Output is correct
12 Correct 56 ms 11860 KB Output is correct
13 Correct 59 ms 11860 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2584 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2524 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 61 ms 10324 KB Output is correct
23 Correct 66 ms 10932 KB Output is correct
24 Correct 65 ms 11464 KB Output is correct
25 Correct 63 ms 11004 KB Output is correct
26 Correct 63 ms 12112 KB Output is correct
27 Correct 57 ms 11132 KB Output is correct
28 Correct 55 ms 11088 KB Output is correct
29 Correct 62 ms 11976 KB Output is correct
30 Correct 69 ms 12152 KB Output is correct
31 Correct 59 ms 10864 KB Output is correct
32 Correct 55 ms 10832 KB Output is correct
33 Correct 56 ms 11860 KB Output is correct
34 Correct 59 ms 11860 KB Output is correct
35 Correct 60 ms 10320 KB Output is correct
36 Correct 66 ms 11824 KB Output is correct
37 Correct 65 ms 12624 KB Output is correct
38 Correct 69 ms 12368 KB Output is correct
39 Correct 62 ms 12368 KB Output is correct
40 Correct 70 ms 12368 KB Output is correct
41 Correct 64 ms 12368 KB Output is correct
42 Correct 65 ms 12404 KB Output is correct
43 Correct 68 ms 11600 KB Output is correct
44 Correct 68 ms 12116 KB Output is correct
45 Correct 61 ms 12112 KB Output is correct
46 Correct 72 ms 13148 KB Output is correct
47 Correct 59 ms 11604 KB Output is correct
48 Correct 60 ms 11604 KB Output is correct
49 Correct 60 ms 10836 KB Output is correct
50 Correct 53 ms 11520 KB Output is correct
51 Correct 54 ms 11808 KB Output is correct
52 Correct 58 ms 11608 KB Output is correct