Submission #1241400

#	Time	Username	Problem	Language	Result	Execution time	Memory
1241400		Geforgs	Snowball (JOI21_ho_t2)	C++20	100 / 100	120 ms	17736 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, q, i, cur=0, l=0, r=0, x, curL, curR;
    cin>>n>>q;
    vector<ll> a(n);
    vector<ll> ans(n);
    set<pair<ll, ll>> dis;
    for(i=0;i<n;++i){
        cin>>a[i];
        if(i > 0){
            dis.insert({a[i] - a[i-1], i});
        }
    }
    for(i=0;i<q;++i){
        curL = l;
        curR = r;
        cin>>x;
        cur += x;
        l = min(l, cur);
        r = max(r, cur);
        while(!dis.empty() and dis.begin()->first <= r - l){
            ans[dis.begin()->second] += a[dis.begin()->second] - max(a[dis.begin()->second] + l, a[dis.begin()->second - 1] + curR);
            ans[dis.begin()->second-1] += min(a[dis.begin()->second] + curL, a[dis.begin()->second-1] + r) - a[dis.begin()->second-1];
            dis.erase(dis.begin());
        }
    }
    while(!dis.empty()){
        ans[dis.begin()->second] += a[dis.begin()->second] - max(a[dis.begin()->second] + l, a[dis.begin()->second - 1] + curR);
        ans[dis.begin()->second-1] += min(a[dis.begin()->second] + curL, a[dis.begin()->second-1] + r) - a[dis.begin()->second-1];
        dis.erase(dis.begin());
    }
    ans[0] -= l;
    ans[n-1] += r;
    for(auto el: ans){
        cout<<el<<endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 33 / 33
• Subtask 2: 67 / 67