oj.uz

Submission #817770

# Submission time Handle Problem Language Result Execution time Memory
817770 2023-08-09T16:05:10 Z t6twotwo Measures (CEOI22_measures) C++17
24 / 100
 179 ms 28276 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FFOR(i,a,b,c) for(int i=(a);(c)>0?i<=(b):i>=(b);i+=(c))
#define FOOR(i,a,b) FFOR(i,a,(b)-1,1)
#define ROOF(i,a,b) FFOR(i,(b)-1,a,-1)
#define FOR(i,n) FOOR(i,0,n)
#define ROF(i,n) ROOF(i,0,n)
#define FORR(x,v) for(auto &x:v)
#define vc vector
#define sz(v) (int)((v).size())
#define bg begin()
#define en end()
#define em empty()
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define ppb pop_back()
#define eb emplace_back
#define bk back()
#define fr front()
#define pp pop()
#define all(v) (v).begin(),(v).end()
#define lla(v) (v).rbegin(),(v).rend()
#define f first
#define s second
struct node {
    ll sum, pre, suf, best;
    node(){sum=pre=suf=best=0;}
    node(ll a){sum=a;pre=suf=best=min(a,0ll);}
};
node operator+(const node &a, const node &b) {
    node c;
    c.sum=a.sum+b.sum;
    c.pre=min(a.pre,a.sum+b.pre);
    c.suf=min(b.suf,b.sum+a.suf);
    c.best=min({a.best,b.best,a.suf+b.pre});
    return c;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M,D;
    cin>>N>>M>>D;
    if(M<=10){
        vc<int> a(N);
        FORR(x,a)cin>>x;
        FOR(i,M){
            int b;
            cin>>b;
            a.pb(b);
            sort(all(a));
            ll s=0,ans=0;
            FOOR(j,1,sz(a)){
                ll k=a[j]-a[j-1]-D;
                s=min(k,s+k);
                ans=min(ans,s);
            }
            ans=-ans;
            if(ans%2==1){
                cout<<ans/2<<"."<<5<<" ";
            }else{
                cout<<ans/2<<" ";
            }
        }
        return 0;
    }
    vc<int> b(M);
    vc<pair<int,int>> p(M);
    FOR(i,M){
        cin>>b[i];
        p[i]={b[i],i};
    }
    sort(all(p));
    vc<int> pos(M);
    FOR(i,M) pos[p[i].s]=i;
    vc<node> st(2*M);
    auto upd = [&](int i, ll v) {
        for(st[i+=M]=v;i/=2;) {
            st[i]=st[i*2]+st[i*2+1];
        }
    };
    set<int> s;
    FOR(i,M){
        auto it=s.ub(pos[i]);
        if(it!=s.bg){
            upd(pos[i],b[i]-p[*prev(it)].f-D);
        }
        if(it!=s.en){
            upd(*it,p[*it].f-b[i]-D);
        }
        s.insert(pos[i]);
        node t;
        for(int l=M,r=2*M;l<r;l/=2,r/=2){
            if(l&1) t=t+st[l++];
            if(r&1) t=st[--r]+t;
        }
        ll ans=-t.best;
        if(ans%2==1){
            cout<<ans/2<<"."<<5<<" ";
        }else{
            cout<<ans/2<<" ";
        }
    }
    return 6/22;
}

Subtask #1
10.0 / 10.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 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.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 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 95 ms 1892 KB Output is correct
10 Correct 138 ms 1876 KB Output is correct
11 Correct 37 ms 1880 KB Output is correct
12 Correct 147 ms 1892 KB Output is correct
13 Correct 40 ms 1876 KB Output is correct
14 Correct 92 ms 1884 KB Output is correct
15 Correct 88 ms 1880 KB Output is correct
16 Correct 42 ms 1876 KB Output is correct

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 26352 KB Output is correct
2 Correct 179 ms 28240 KB Output is correct
3 Correct 158 ms 28276 KB Output is correct
4 Correct 157 ms 26228 KB Output is correct
5 Incorrect 150 ms 27400 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 26352 KB Output is correct
2 Correct 179 ms 28240 KB Output is correct
3 Correct 158 ms 28276 KB Output is correct
4 Correct 157 ms 26228 KB Output is correct
5 Incorrect 150 ms 27400 KB Output isn't correct
6 Halted 0 ms 0 KB -