제출 #1239710

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239710		M_SH_O	Snowball (JOI21_ho_t2)	C++20	100 / 100	159 ms	19300 KiB

Main

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000007
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(time(0));
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main(){
    speed;
    srand(time(0));
    ll n, m;
    cin >> n >> m;
    vll a(n);
    for (int i =0 ; i < n ;i ++) {
        cin >> a[i];
    }
    vpll v(n, {-1, -1});
    set<pll> s;
    for (int i = 0; i < n-1; i ++) {
        s.insert({a[i+1]-a[i], i});
    }
    s.insert({INF, -1});
    ll l = 0, r = 0, x = 0;
    while (m --) {
        ll k;
        cin >> k;
        x += k;
        ll l1 = l, r1 = r;
        r = max(r, x);
        l = min(l, x);
        while ((*s.begin()).fr <= r-l) {
            pll p = *s.begin();
            s.erase(s.begin());
            if (k < 0) {
                v[p.se].se = r;
                v[p.se+1].fr = p.fr-r;
            }
            else {
                v[p.se+1].fr = -l;
                v[p.se].se = p.fr+l;
            }
        }
    }
    //cout << l << ' ' << r << endl;
    for (int i =0 ; i < n; i ++) {
        //cout << v[i].fr << ' ' << v[i].se << endl;
        if (v[i].fr == -1) v[i].fr = -l;
        if (v[i].se == -1) v[i].se = r;

        cout << v[i].fr+v[i].se << endl;
    }
}

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