oj.uz

Submission #68237

# Submission time Handle Problem Language Result Execution time Memory
68237 2018-08-16T09:28:55 Z Windazz Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 512 ms 7496 KB 
#include <iostream>
#include <fstream>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iterator>
#include <ext/pb_ds/assoc_container.hpp>

#define x first
#define y second
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(),x.end()

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;

const ll INF=1e18+123;
const ld EPS=1e-9;
const int inf=1e9+123;
const int MOD=1e9+7;
const int N=2e5+123;
const int dx[]={0ll,0ll,1,-1};
const int dy[]={1,-1,0ll,0ll};

ll a[N],x[N];

int main(){
    ios_base::sync_with_stdio(0ll);
    cin.tie(0ll);
    int n,q;
    ll s,t;
    cin>>n>>q>>s>>t;
    ll ans=0ll;
    cin>>a[0ll];
    for(int i=1;i<=n;i++){
        cin>>a[i];
        x[i]=-a[i]+a[i-1];
        ans+=1ll*s*min(x[i],0ll);
        ans+=1ll*t*max(x[i],0ll);
    }
    int l,r,c;
    while(q--){
        cin>>l>>r>>c;
        r++;
        if(l<=n){
            ans-=s*min(x[l],0ll);
            ans-=t*max(x[l],0ll);
            x[l]-=c;
            ans+=s*min(x[l],0ll);
            ans+=t*max(x[l],0ll);
        }
        if(r<=n){
            ans-=s*min(x[r],0ll);
            ans-=t*max(x[r],0ll);
            x[r]+=c;
            ans+=s*min(x[r],0ll);
            ans+=t*max(x[r],0ll);
        }
        cout<<ans<<endl;
    }
    return 0ll;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 8 ms 612 KB Output is correct
3 Correct 7 ms 680 KB Output is correct
4 Correct 7 ms 680 KB Output is correct
5 Correct 7 ms 680 KB Output is correct
6 Correct 7 ms 680 KB Output is correct
7 Correct 7 ms 680 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 7 ms 720 KB Output is correct
10 Correct 8 ms 720 KB Output is correct
11 Correct 8 ms 720 KB Output is correct
12 Correct 9 ms 720 KB Output is correct
13 Correct 6 ms 728 KB Output is correct
14 Correct 6 ms 728 KB Output is correct
15 Correct 6 ms 816 KB Output is correct
16 Correct 6 ms 816 KB Output is correct
17 Correct 6 ms 816 KB Output is correct
18 Correct 6 ms 816 KB Output is correct
19 Correct 2 ms 816 KB Output is correct
20 Correct 2 ms 816 KB Output is correct
21 Correct 2 ms 816 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 5148 KB Output is correct
2 Correct 454 ms 5960 KB Output is correct
3 Correct 481 ms 6332 KB Output is correct
4 Correct 434 ms 6332 KB Output is correct
5 Correct 466 ms 6344 KB Output is correct
6 Correct 403 ms 6704 KB Output is correct
7 Correct 414 ms 6716 KB Output is correct
8 Correct 496 ms 6752 KB Output is correct
9 Correct 486 ms 7012 KB Output is correct
10 Correct 463 ms 7012 KB Output is correct
11 Correct 403 ms 7012 KB Output is correct
12 Correct 408 ms 7192 KB Output is correct
13 Correct 432 ms 7484 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 8 ms 612 KB Output is correct
3 Correct 7 ms 680 KB Output is correct
4 Correct 7 ms 680 KB Output is correct
5 Correct 7 ms 680 KB Output is correct
6 Correct 7 ms 680 KB Output is correct
7 Correct 7 ms 680 KB Output is correct
8 Correct 6 ms 720 KB Output is correct
9 Correct 7 ms 720 KB Output is correct
10 Correct 8 ms 720 KB Output is correct
11 Correct 8 ms 720 KB Output is correct
12 Correct 9 ms 720 KB Output is correct
13 Correct 6 ms 728 KB Output is correct
14 Correct 6 ms 728 KB Output is correct
15 Correct 6 ms 816 KB Output is correct
16 Correct 6 ms 816 KB Output is correct
17 Correct 6 ms 816 KB Output is correct
18 Correct 6 ms 816 KB Output is correct
19 Correct 2 ms 816 KB Output is correct
20 Correct 2 ms 816 KB Output is correct
21 Correct 2 ms 816 KB Output is correct
22 Correct 442 ms 5148 KB Output is correct
23 Correct 454 ms 5960 KB Output is correct
24 Correct 481 ms 6332 KB Output is correct
25 Correct 434 ms 6332 KB Output is correct
26 Correct 466 ms 6344 KB Output is correct
27 Correct 403 ms 6704 KB Output is correct
28 Correct 414 ms 6716 KB Output is correct
29 Correct 496 ms 6752 KB Output is correct
30 Correct 486 ms 7012 KB Output is correct
31 Correct 463 ms 7012 KB Output is correct
32 Correct 403 ms 7012 KB Output is correct
33 Correct 408 ms 7192 KB Output is correct
34 Correct 432 ms 7484 KB Output is correct
35 Correct 449 ms 7484 KB Output is correct
36 Correct 452 ms 7484 KB Output is correct
37 Correct 457 ms 7496 KB Output is correct
38 Correct 446 ms 7496 KB Output is correct
39 Correct 454 ms 7496 KB Output is correct
40 Correct 505 ms 7496 KB Output is correct
41 Correct 464 ms 7496 KB Output is correct
42 Correct 451 ms 7496 KB Output is correct
43 Correct 495 ms 7496 KB Output is correct
44 Correct 457 ms 7496 KB Output is correct
45 Correct 478 ms 7496 KB Output is correct
46 Correct 459 ms 7496 KB Output is correct
47 Correct 488 ms 7496 KB Output is correct
48 Correct 470 ms 7496 KB Output is correct
49 Correct 490 ms 7496 KB Output is correct
50 Correct 512 ms 7496 KB Output is correct
51 Correct 487 ms 7496 KB Output is correct
52 Correct 465 ms 7496 KB Output is correct