oj.uz

Submission #367810

# Submission time Handle Problem Language Result Execution time Memory
367810 2021-02-18T12:42:48 Z vaaven Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 194 ms 13164 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <stack>
#include <iomanip>
#include <bitset>
#include <map>
#include <cassert>
#include <array>
#include <queue>
#include <cstring>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define pqueue priority_queue
#define pb(x) push_back(x)
 #define endl '\n'
#define all(x) x.begin(), x.end()
#define int long  long
    
using namespace std;
    
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
// typedef tuple<ll, ll, ll> tiii;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
    
const int inf = 1e9 + 228;
const int infll = 1e18;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-14;
    
    
void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    freopen("inputik.txt", "r", stdin);
//    freopen("outputik.txt", "w", stdout);
}
 
 
const int maxn = 2e5 + 228;
int t[maxn], a[maxn], n, q;
 
void add(int i, int x){
    for(; i<maxn; i+=i&-i)
        t[i] += x;
}
 
int get(int i){
    int res = 0;
    for(; i>0; i-=i&-i)
        res += t[i];
    return res;
}
 
 
int get(int a, int b, int s, int t){
    if(a < b)
        return - s * (b-a);
    else
        return t * (a-b);
}
   
void solve(){
    int s, t;
    cin >> n >> q >> s >> t;
    for(int i=0; i<=n; i++){
        cin >> a[i];
    }
    int ans = 0;
    for(int i=1; i<=n; i++){
        ans += get(a[i-1], a[i], s, t);
    }
    for(int i=1; i<=q; i++){
        int l, r, x;
        cin >> l >> r >> x;
        ans -= get(a[l-1] + get(l-1), a[l] + get(l), s, t);
        if(r != n)
            ans -= get(a[r] + get(r), a[r+1] + get(r+1), s, t);
        add(l, x);
        add(r+1, -x);
        ans += get(a[l-1] + get(l-1), a[l] + get(l), s, t);
        if(r != n)
            ans += get(a[r] + get(r), a[r+1] + get(r+1), s, t);
        cout << ans << endl;
    }
       
}
   
signed main(){
     fast_io();
//  ;(time(NULL));
    cout << fixed << setprecision(10);
    int q = 1;
//    cin >> q;
    while(q--)
        solve();
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 10476 KB Output is correct
2 Correct 166 ms 11036 KB Output is correct
3 Correct 169 ms 11628 KB Output is correct
4 Correct 184 ms 10988 KB Output is correct
5 Correct 168 ms 12140 KB Output is correct
6 Correct 111 ms 9568 KB Output is correct
7 Correct 113 ms 9504 KB Output is correct
8 Correct 170 ms 12012 KB Output is correct
9 Correct 171 ms 12380 KB Output is correct
10 Correct 151 ms 10988 KB Output is correct
11 Correct 113 ms 9452 KB Output is correct
12 Correct 116 ms 10220 KB Output is correct
13 Correct 110 ms 10476 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 190 ms 10476 KB Output is correct
23 Correct 166 ms 11036 KB Output is correct
24 Correct 169 ms 11628 KB Output is correct
25 Correct 184 ms 10988 KB Output is correct
26 Correct 168 ms 12140 KB Output is correct
27 Correct 111 ms 9568 KB Output is correct
28 Correct 113 ms 9504 KB Output is correct
29 Correct 170 ms 12012 KB Output is correct
30 Correct 171 ms 12380 KB Output is correct
31 Correct 151 ms 10988 KB Output is correct
32 Correct 113 ms 9452 KB Output is correct
33 Correct 116 ms 10220 KB Output is correct
34 Correct 110 ms 10476 KB Output is correct
35 Correct 163 ms 10476 KB Output is correct
36 Correct 164 ms 11956 KB Output is correct
37 Correct 192 ms 12652 KB Output is correct
38 Correct 170 ms 12524 KB Output is correct
39 Correct 194 ms 12524 KB Output is correct
40 Correct 181 ms 12524 KB Output is correct
41 Correct 170 ms 12268 KB Output is correct
42 Correct 180 ms 12524 KB Output is correct
43 Correct 168 ms 11756 KB Output is correct
44 Correct 167 ms 12140 KB Output is correct
45 Correct 163 ms 12268 KB Output is correct
46 Correct 192 ms 13164 KB Output is correct
47 Correct 112 ms 10220 KB Output is correct
48 Correct 129 ms 10344 KB Output is correct
49 Correct 152 ms 10732 KB Output is correct
50 Correct 117 ms 10092 KB Output is correct
51 Correct 126 ms 10476 KB Output is correct
52 Correct 118 ms 10348 KB Output is correct