제출 #381158

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381158		usachevd0	Snowball (JOI21_ho_t2)	C++14	100 / 100	148 ms	15644 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using ld = long double;
template<typename T1, typename T2> bool chkmin(T1 &x, T2 y) { return y < x ? (x = y, true) : false; }
template<typename T1, typename T2> bool chkmax(T1 &x, T2 y) { return y > x ? (x = y, true) : false; }
void debug_out() { cerr << endl; }
template<typename T1, typename... T2> void debug_out(T1 A, T2... B) { cerr << ' ' << A; debug_out(B...); }
template<typename T> void mdebug_out(T* a, int n) { for (int i = 0; i < n; ++i) cerr << a[i] << ' '; cerr << endl; }
#ifdef DEBUG
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
    #define mdebug(a, n) cerr << #a << ": ", mdebug_out(a, n)
#else
    #define debug(...) 1337
    #define mdebug(a, n) 1337
#endif
template<typename T> ostream& operator << (ostream& stream, const vector<T> &v) { for (auto x : v) stream << x << ' '; return stream; }
template<typename T1, typename T2> ostream& operator << (ostream& stream, const pair<T1, T2>& p) { return stream << p.first << ' ' << p.second; }

const int N = 200005;
ll X[N], D[N];
ll L[N], R[N];
ll ans[N];

signed main()
{
#ifdef DEBUG
    freopen("in", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, Q;
    cin >> n >> Q;
    for (int i = 1; i <= n; ++i)
    {
        cin >> X[i];
    }
    L[0] = R[0] = 0;
    ll S = 0;
    for (int j = 1; j <= Q; ++j)
    {
        cin >> D[j];
        S += D[j];
        L[j] = min(L[j - 1], S);
        R[j] = max(R[j - 1], S);
    }
    ans[1] -= L[Q];
    ans[n] += R[Q];
    for (int i = 1; i + 1 <= n; ++i)
    {
        int ul = 0;
        int ur = Q + 1;
        while (ur - ul > 1)
        {
            int um = (ul + ur) >> 1;
            if (X[i] + R[um] >= X[i + 1] + L[um])
                ur = um;
            else
                ul = um;
        }
        if (ur == Q + 1)
        {
            ans[i] += R[Q];
            ans[i + 1] -= L[Q];
            continue;
        }
        if (L[ul] == L[ur])
        {
            ans[i] += X[i + 1] - X[i] + L[ul];
            ans[i + 1] -= L[ul];
        }
        else
        {
            ans[i] += R[ul];
            ans[i + 1] += X[i + 1] - X[i] - R[ul];
        }
    }
    for (int i = 1; i <= n; ++i)
        cout << ans[i] << '\n';
    
    return 0;
}

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