Submission #1185881

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185881		Zbyszek99	Snowball (JOI21_ho_t2)	C++20	100 / 100	90 ms	8264 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll poz[200'002];
ll min_pref[200'002];
ll max_pref[200'002];
ll W[200'002];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    poz[0] = -1e18;
    poz[n+1] = 1e18;
    rep2(i,1,n) cin >> poz[i];
    ll cur_vec = 0;
    rep2(i,1,q)
    {
        ll w;
        cin >> w;
        W[i] = w;
        cur_vec += w;
        min_pref[i] = min(min_pref[i-1],cur_vec);
        max_pref[i] = max(max_pref[i-1],cur_vec);
    }
    rep2(i,1,n)
    {
        ll l_bor = poz[i];
        ll r_bor = poz[i];
        int l = 0;
        int r = q;
        int ans = 0;
        while(l <= r)
        {
            int mid = (l+r)/2;
            if(poz[i] + min_pref[mid] >= poz[i-1] + max_pref[mid])
            {
                ans = mid;
                l = mid+1;
            }
            else
            {
                r = mid-1;
            }
        }
        l_bor = poz[i] + min_pref[ans];
        if(W[ans+1] < 0)
        {
            l_bor = poz[i-1] + max_pref[ans];
        }
        l = 0;
        r = q;
        ans = 0;
        while(l <= r)
        {
            int mid = (l+r)/2;
            if(poz[i] + max_pref[mid] <= poz[i+1] + min_pref[mid])
            {
                ans = mid;
                l = mid+1;
            }
            else
            {
                r = mid-1;
            }
        }
        r_bor = poz[i] + max_pref[ans];
        if(W[ans+1] > 0)
        {
            r_bor = poz[i+1] + min_pref[ans];
        }
        cout << r_bor - l_bor << "\n";
    }
}

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