oj.uz

Submission #687638

# Submission time Handle Problem Language Result Execution time Memory
687638 2023-01-26T17:31:13 Z beedle Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 136 ms 13076 KB 
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <complex>
#include <assert.h>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define ld long long double
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define mod 1000000007ll
#define INF 1e18
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin (), (x).end ()
#define sz(x) (ll) (x).size ()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rank rnk
#define log lg
#define fast                                                                  \
    ios_base::sync_with_stdio (false);                                        \
    cin.tie (NULL);                                                           \
    cout.tie (NULL)

using namespace std;

struct FenwickTree {
    vector<ll> bit;  // binary indexed tree
    ll n;

    FenwickTree(ll n) {
        this->n = n;
        bit.assign(n, 0);
    }

    FenwickTree(vector<ll> a) : FenwickTree(a.size()) {
        for (size_t i = 0; i < a.size(); i++)
            add(i, a[i]);
    }

    ll sum(ll r) {
        ll ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    ll sum(ll l, ll r) {
        return sum(r) - sum(l - 1);
    }

    void add(ll idx, ll delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};

signed main()
{
    fast;

    ll n,q,s,t;
	cin>>n>>q>>s>>t;

	vector <ll> a(n+1);
	rep(i,0,n)
	cin>>a[i];

	ll c=0;
	rep(i,1,n)
	c+=(a[i]>a[i-1]?s*(a[i-1]-a[i]):t*(a[i-1]-a[i]));

	FenwickTree f(n+2);
	while(q--)
	{
		ll l,r,del;
		cin>>l>>r>>del;
		ll cl=a[l]+f.sum(l);
		ll clprev=a[l-1]+f.sum(l-1);
		ll nl=cl+del;
		c+=(nl>clprev?s*(clprev-nl):t*(clprev-nl))-(cl>clprev?s*(clprev-cl):t*(clprev-cl));
		if(r!=n)
		{
			ll cr=a[r]+f.sum(r);
			ll crnext=a[r+1]+f.sum(r+1);
			ll nr=cr+del;
			c+=(crnext>nr?s*(nr-crnext):t*(nr-crnext))-(crnext>cr?s*(cr-crnext):t*(cr-crnext));
		}
		f.add(l,del);
		f.add(r+1,-del);
		cout<<c<<endl;
	}

    return 0;
}

/*
3 5 1 2 
0
4
1
8 
1 2 2 
1 1 -2 
2 3 5 
1 2 -1 
1 3 5
*/

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 10296 KB Output is correct
2 Correct 134 ms 10912 KB Output is correct
3 Correct 116 ms 11464 KB Output is correct
4 Correct 109 ms 10832 KB Output is correct
5 Correct 113 ms 11952 KB Output is correct
6 Correct 92 ms 10972 KB Output is correct
7 Correct 84 ms 11024 KB Output is correct
8 Correct 115 ms 11860 KB Output is correct
9 Correct 119 ms 12120 KB Output is correct
10 Correct 118 ms 10928 KB Output is correct
11 Correct 91 ms 10948 KB Output is correct
12 Correct 86 ms 11596 KB Output is correct
13 Correct 82 ms 11852 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 328 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 372 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 118 ms 10296 KB Output is correct
23 Correct 134 ms 10912 KB Output is correct
24 Correct 116 ms 11464 KB Output is correct
25 Correct 109 ms 10832 KB Output is correct
26 Correct 113 ms 11952 KB Output is correct
27 Correct 92 ms 10972 KB Output is correct
28 Correct 84 ms 11024 KB Output is correct
29 Correct 115 ms 11860 KB Output is correct
30 Correct 119 ms 12120 KB Output is correct
31 Correct 118 ms 10928 KB Output is correct
32 Correct 91 ms 10948 KB Output is correct
33 Correct 86 ms 11596 KB Output is correct
34 Correct 82 ms 11852 KB Output is correct
35 Correct 133 ms 10440 KB Output is correct
36 Correct 127 ms 11836 KB Output is correct
37 Correct 120 ms 12624 KB Output is correct
38 Correct 125 ms 12472 KB Output is correct
39 Correct 115 ms 12368 KB Output is correct
40 Correct 126 ms 12368 KB Output is correct
41 Correct 112 ms 12208 KB Output is correct
42 Correct 114 ms 12360 KB Output is correct
43 Correct 109 ms 11624 KB Output is correct
44 Correct 136 ms 11968 KB Output is correct
45 Correct 121 ms 12104 KB Output is correct
46 Correct 117 ms 13076 KB Output is correct
47 Correct 110 ms 11684 KB Output is correct
48 Correct 95 ms 11728 KB Output is correct
49 Correct 108 ms 10664 KB Output is correct
50 Correct 93 ms 11460 KB Output is correct
51 Correct 81 ms 11780 KB Output is correct
52 Correct 83 ms 11692 KB Output is correct