Submission #768999

#	Time	Username	Problem	Language	Result	Execution time	Memory
768999		bachhoangxuan	Snowball (JOI21_ho_t2)	C++17	100 / 100	72 ms	13908 KiB

Main

// 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),erase(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<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
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;cin >> n >> q;
    vector<int> x(n),ans(n,0);
    vector<pii> p;
    for(int i=0;i<n;i++){
        cin >> x[i];
        if(i) p.push_back({x[i]-x[i-1],i});
    }
    sort(p.begin(),p.end());
    int l=0,r=0,c=0,pos=0;
    for(int i=1;i<=q;i++){
        int w;cin >> w;
        if(c+w<l){
            while(pos<n-1 && p[pos].fi<=r-c-w){
                int k=p[pos].se;
                ans[k-1]+=r;ans[k]+=p[pos].fi-r;pos++;
            }
        }
        else if(c+w>r){
            while(pos<n-1 && p[pos].fi<=c+w-l){
                int k=p[pos].se;
                ans[k]-=l;ans[k-1]+=p[pos].fi+l;pos++;
            }
        }
        c+=w;l=min(l,c);r=max(r,c);
    }
    ans[0]-=l;ans[n-1]+=r;
    for(int i=0;i<n-1;i++){
        if(x[i+1]-x[i]>r-l) ans[i]+=r,ans[i+1]-=l;
    }
    for(int i=0;i<n;i++) cout << ans[i] << '\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: 33 / 33
• Subtask 2: 67 / 67