oj.uz

Submission #758997

# Submission time Handle Problem Language Result Execution time Memory
758997 2023-06-15T16:28:04 Z bachhoangxuan Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 86 ms 11464 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,q,s,t,p,ans=0;cin >> n >> q >> s >> t >> p;
    vector<int> a(n,0);
    for(int i=0;i<n;i++){
        cin >> a[i];
        swap(a[i],p);a[i]-=p;
        ans+=(a[i]<0?s:t)*a[i];
    }
    while(q--){
        int l,r,x;cin >> l >> r >> x;l--;
        ans-=(a[l]<0?s:t)*a[l];
        a[l]-=x;
        ans+=(a[l]<0?s:t)*a[l];
        if(r<n){
            ans-=(a[r]<0?s:t)*a[r];
            a[r]+=x;
            ans+=(a[r]<0?s:t)*a[r];
        }
        cout << ans << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 340 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 332 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 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 70 ms 8660 KB Output is correct
2 Correct 71 ms 9352 KB Output is correct
3 Correct 72 ms 9940 KB Output is correct
4 Correct 79 ms 9296 KB Output is correct
5 Correct 73 ms 10456 KB Output is correct
6 Correct 66 ms 9416 KB Output is correct
7 Correct 68 ms 9420 KB Output is correct
8 Correct 74 ms 10188 KB Output is correct
9 Correct 73 ms 10532 KB Output is correct
10 Correct 75 ms 9308 KB Output is correct
11 Correct 61 ms 9300 KB Output is correct
12 Correct 66 ms 10056 KB Output is correct
13 Correct 69 ms 10316 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 340 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 332 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 70 ms 8660 KB Output is correct
23 Correct 71 ms 9352 KB Output is correct
24 Correct 72 ms 9940 KB Output is correct
25 Correct 79 ms 9296 KB Output is correct
26 Correct 73 ms 10456 KB Output is correct
27 Correct 66 ms 9416 KB Output is correct
28 Correct 68 ms 9420 KB Output is correct
29 Correct 74 ms 10188 KB Output is correct
30 Correct 73 ms 10532 KB Output is correct
31 Correct 75 ms 9308 KB Output is correct
32 Correct 61 ms 9300 KB Output is correct
33 Correct 66 ms 10056 KB Output is correct
34 Correct 69 ms 10316 KB Output is correct
35 Correct 71 ms 8876 KB Output is correct
36 Correct 86 ms 10188 KB Output is correct
37 Correct 76 ms 10984 KB Output is correct
38 Correct 78 ms 10828 KB Output is correct
39 Correct 73 ms 10816 KB Output is correct
40 Correct 76 ms 10828 KB Output is correct
41 Correct 74 ms 10732 KB Output is correct
42 Correct 73 ms 10712 KB Output is correct
43 Correct 72 ms 9992 KB Output is correct
44 Correct 74 ms 10444 KB Output is correct
45 Correct 72 ms 10512 KB Output is correct
46 Correct 81 ms 11464 KB Output is correct
47 Correct 66 ms 10112 KB Output is correct
48 Correct 65 ms 10060 KB Output is correct
49 Correct 63 ms 9116 KB Output is correct
50 Correct 67 ms 9916 KB Output is correct
51 Correct 66 ms 10288 KB Output is correct
52 Correct 64 ms 10076 KB Output is correct