oj.uz

Submission #378219

# Submission time Handle Problem Language Result Execution time Memory
378219 2021-03-16T09:02:59 Z Atill83 Snowball (JOI21_ho_t2) C++14
0 / 100
 1 ms 492 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
ll x[MAXN];
ll ans[MAXN];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    int q;
    cin>>n>>q;


    x[0] = -INF;
    for(int i = 1; i <= n; i++)
        cin>>x[i];

    x[n + 1] = INF;


    ll curdel = 0;

    map<ll, pair<pll, ll>> mp;
    mp[0] = {{0, 0}, 0};
    ll altmax = 0, ustmax = 0;
    for(int i = 1; i <= q; i++){
        int x;
        cin>>x;
        curdel += x;
        if(curdel < altmax){
            altmax = curdel;
            mp[-altmax + ustmax] = {{-altmax, ustmax}, 0};
        }else if(curdel > ustmax){
            ustmax = curdel;
            mp[-altmax + ustmax] = {{-altmax, ustmax}, 1};
        }
    }

    for(int i = 0; i <= n; i++){
        ll delta = x[i + 1] - x[i];
        auto u = mp.lower_bound(delta);
        if(u == mp.end()){
            ans[i] += (*prev(u)).ss.ff.ss;
            ans[i + 1] += ((*prev(u)).ss.ff.ff);
        }else{
            //cout<<delta<<" "<<(*u).ff<<" "<<(*u).ss.ff.ff<<" "<<(*u).ss.ff.ss<<" "<<(*u).ss.ss<<endl;
            ans[i + 1] += (*u).ss.ff.ff;
            ans[i] += (*u).ss.ff.ss;
            ans[i + !(*u).ss.ss] -= ((*u).ff - delta);
        }
    }

    for(int i = 1; i <= n; i++)
        cout<<ans[i]<<endl;


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -