Submission #1136227

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136227		pan	Snowball (JOI21_ho_t2)	C++20	100 / 100	139 ms	9924 KiB

Main

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



int main()
{
    ll n, q;
    cin >> n >> q;
    vector<ll> a(n), que(q + 1, 0), ans(n, 0);
    vector<pi> gap;
    for (ll i=0; i<n; ++i)  cin >> a[i];
    for (ll i=0; i<n-1; ++i) gap.pb(mp(a[i+1]-a[i], i));
    sort(all(gap));
    for (ll i=1; i<=q; ++i) cin >> que[i];
    ll idxp = 0, idxn = 0, idx = 0;
    for (ll i=1; i<=q; ++i)
    {
		//show(i); 
		que[i] += que[i-1];
		//show(que[i]);
		if (que[i] > 0 && que[i] > que[idxp]) idxp = i;
		if (que[i] < 0 && que[i] < que[idxn]) idxn = i;
		//show2(idxp, idxn);
		while (idx < n-1 && gap[idx].f <= abs(que[idxp]) + abs(que[idxn]))
		{
			ll siz = gap[idx].f, now = gap[idx].s;
			//show2(siz, now);
			if (idxp < idxn) // p win
			{
				ans[now] += que[idxp];
				ans[now+1] += siz - que[idxp];
			}
			else
			{
				ans[now+1] += abs(que[idxn]);
				ans[now] += siz - abs(que[idxn]);
			}
			idx++;
		}
		//for (ll i=0; i<n; ++i) cout << ans[i] << ' ';
		//cout << endl;
	}
	while (idx < n-1)
	{
		ll now = gap[idx].s;
		ans[now] += abs(que[idxp]);
		ans[now+1] += abs(que[idxn]);
		idx++;
	}
	ans[0] += abs(que[idxn]); ans[n-1] += abs(que[idxp]);
  for (ll i=0; i<n; ++i) cout << ans[i] << endl;
  return 0;
}

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