oj.uz

Submission #442973

# Submission time Handle Problem Language Result Execution time Memory
442973 2021-07-09T12:25:01 Z zaneyu Snowball (JOI21_ho_t2) C++14
100 / 100
 128 ms 15536 KB 
/*input
4 3
-2 3 5 8
2
-4
7
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=2e5+5;
const int maxlg=__lg(maxn)+2;
ll arr[maxn];
ll L[maxn],R[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,q;
    cin>>n>>q;
    REP(i,n){
        cin>>arr[i];
    }
    vector<pii> v;
    REP1(i,n-1) v.pb({arr[i]-arr[i-1],i});
    REP(i,n) L[i]=R[i]=-INF64;
    sort(ALL(v));
    ll l=0,r=0,cur=0;
    int p=0;
    while(q--){
        ll x;
        cin>>x;
        cur+=x;
        MNTO(l,cur);
        MXTO(r,cur);
        while(p<sz(v) and v[p].f<=r-l){
            int i=v[p].s;
            if(x<0){
                R[i-1]=r+arr[i-1];
                L[i]=R[i-1];
            }
            else{
                L[i]=l+arr[i];
                R[i-1]=L[i];
            }
            ++p;
        }
    }
    REP(i,n){
        if(L[i]==-INF64) L[i]=l+arr[i];
        if(R[i]==-INF64) R[i]=r+arr[i];
        cout<<R[i]-L[i]<<'\n';
    }
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 2 ms 464 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 31 ms 2364 KB Output is correct
21 Correct 29 ms 2236 KB Output is correct
22 Correct 29 ms 1996 KB Output is correct
23 Correct 27 ms 1916 KB Output is correct
24 Correct 35 ms 3024 KB Output is correct
25 Correct 124 ms 13552 KB Output is correct
26 Correct 109 ms 13516 KB Output is correct
27 Correct 105 ms 13132 KB Output is correct
28 Correct 109 ms 13336 KB Output is correct
29 Correct 128 ms 12744 KB Output is correct
30 Correct 101 ms 12156 KB Output is correct
31 Correct 96 ms 11592 KB Output is correct
32 Correct 78 ms 11820 KB Output is correct
33 Correct 11 ms 1740 KB Output is correct
34 Correct 117 ms 13924 KB Output is correct
35 Correct 104 ms 13324 KB Output is correct
36 Correct 105 ms 13488 KB Output is correct
37 Correct 106 ms 13348 KB Output is correct
38 Correct 105 ms 13128 KB Output is correct
39 Correct 103 ms 13344 KB Output is correct
40 Correct 106 ms 13336 KB Output is correct
41 Correct 35 ms 3004 KB Output is correct
42 Correct 94 ms 11816 KB Output is correct
43 Correct 97 ms 15020 KB Output is correct
44 Correct 36 ms 2880 KB Output is correct
45 Correct 99 ms 13328 KB Output is correct
46 Correct 113 ms 15196 KB Output is correct
47 Correct 104 ms 15460 KB Output is correct
48 Correct 102 ms 15536 KB Output is correct