oj.uz

Submission #659007

# Submission time Handle Problem Language Result Execution time Memory
659007 2022-11-15T18:41:02 Z ssense Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 114 ms 13260 KB 
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int sign(int x) {
    return (x > 0) - (x < 0);
}

int n, q, s, t;

int get(int old, int now)
{
    int change = 0;
    if(old > 0)
    {
        change+=s*old;
    }
    else
    {
        change+=t*old;
    }
    if(now > 0)
    {
        change-=s*now;
    }
    else
    {
        change-=t*now;
    }
    return change;
}

void solve()
{
    cin >> n >> q >> s >> t;
    vint a = read(n+1);
    vint darr;
    int now = 0;
    for(int i = 1; i <= n; i++)
    {
        darr.pb(a[i]-a[i-1]);
        if(darr.back() > 0)
        {
            now-=s*darr.back();
        }
        else
        {
            now-=t*darr.back();
        }
    }
    for(int i = 0; i < q; i++)
    {
        int l, r, x;
        cin >> l >> r >> x;
        now+=get(darr[l-1], darr[l-1]+x);
        darr[l-1]+=x;
        if(r != n)
        {
            now+=get(darr[r], darr[r]-x);
            darr[r]-=x;
        }
        cout << now << endl;
    }
}

int32_t main(){
    startt
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
3 5 1 2
0
4
1
8
1 2 2
1 1 -2
2 3 5
1 2 -1
1 3 5
 

 */

Compilation message

foehn_phenomena.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
foehn_phenomena.cpp:20:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

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 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 376 KB Output is correct
18 Correct 1 ms 424 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 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 86 ms 4968 KB Output is correct
2 Correct 88 ms 5544 KB Output is correct
3 Correct 106 ms 6192 KB Output is correct
4 Correct 85 ms 5380 KB Output is correct
5 Correct 92 ms 6064 KB Output is correct
6 Correct 77 ms 6496 KB Output is correct
7 Correct 79 ms 6504 KB Output is correct
8 Correct 92 ms 6616 KB Output is correct
9 Correct 89 ms 6736 KB Output is correct
10 Correct 87 ms 5524 KB Output is correct
11 Correct 72 ms 6556 KB Output is correct
12 Correct 73 ms 6940 KB Output is correct
13 Correct 90 ms 7456 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 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 376 KB Output is correct
18 Correct 1 ms 424 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 86 ms 4968 KB Output is correct
23 Correct 88 ms 5544 KB Output is correct
24 Correct 106 ms 6192 KB Output is correct
25 Correct 85 ms 5380 KB Output is correct
26 Correct 92 ms 6064 KB Output is correct
27 Correct 77 ms 6496 KB Output is correct
28 Correct 79 ms 6504 KB Output is correct
29 Correct 92 ms 6616 KB Output is correct
30 Correct 89 ms 6736 KB Output is correct
31 Correct 87 ms 5524 KB Output is correct
32 Correct 72 ms 6556 KB Output is correct
33 Correct 73 ms 6940 KB Output is correct
34 Correct 90 ms 7456 KB Output is correct
35 Correct 94 ms 10564 KB Output is correct
36 Correct 110 ms 12012 KB Output is correct
37 Correct 114 ms 12724 KB Output is correct
38 Correct 94 ms 12496 KB Output is correct
39 Correct 98 ms 12688 KB Output is correct
40 Correct 96 ms 12612 KB Output is correct
41 Correct 111 ms 12424 KB Output is correct
42 Correct 105 ms 12500 KB Output is correct
43 Correct 100 ms 11712 KB Output is correct
44 Correct 90 ms 12148 KB Output is correct
45 Correct 94 ms 12128 KB Output is correct
46 Correct 94 ms 13260 KB Output is correct
47 Correct 84 ms 11828 KB Output is correct
48 Correct 85 ms 11768 KB Output is correct
49 Correct 87 ms 10784 KB Output is correct
50 Correct 85 ms 11668 KB Output is correct
51 Correct 105 ms 11932 KB Output is correct
52 Correct 76 ms 11812 KB Output is correct