oj.uz

Submission #768999

# Submission time Handle Problem Language Result Execution time Memory
768999 2023-06-29T04:33:31 Z bachhoangxuan Snowball (JOI21_ho_t2) C++17
100 / 100
 72 ms 13908 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),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.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 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 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 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 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 17 ms 2380 KB Output is correct
21 Correct 17 ms 2208 KB Output is correct
22 Correct 18 ms 1996 KB Output is correct
23 Correct 17 ms 1936 KB Output is correct
24 Correct 18 ms 2848 KB Output is correct
25 Correct 72 ms 12020 KB Output is correct
26 Correct 62 ms 11952 KB Output is correct
27 Correct 60 ms 11568 KB Output is correct
28 Correct 71 ms 11696 KB Output is correct
29 Correct 65 ms 11184 KB Output is correct
30 Correct 59 ms 10672 KB Output is correct
31 Correct 64 ms 10032 KB Output is correct
32 Correct 44 ms 10168 KB Output is correct
33 Correct 8 ms 1624 KB Output is correct
34 Correct 62 ms 12356 KB Output is correct
35 Correct 61 ms 11756 KB Output is correct
36 Correct 61 ms 11968 KB Output is correct
37 Correct 62 ms 11672 KB Output is correct
38 Correct 63 ms 11568 KB Output is correct
39 Correct 66 ms 11828 KB Output is correct
40 Correct 62 ms 11824 KB Output is correct
41 Correct 20 ms 2992 KB Output is correct
42 Correct 53 ms 10236 KB Output is correct
43 Correct 52 ms 13488 KB Output is correct
44 Correct 19 ms 2860 KB Output is correct
45 Correct 58 ms 11700 KB Output is correct
46 Correct 59 ms 13616 KB Output is correct
47 Correct 62 ms 13908 KB Output is correct
48 Correct 63 ms 13864 KB Output is correct