Submission #773137

#	Time	Username	Problem	Language	Result	Execution time	Memory
773137		raysh07	Snowball (JOI21_ho_t2)	C++17	100 / 100	140 ms	11924 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2e5 + 69;
int n, m;
int a[N], b[N], mn[N], mx[N];

void Solve()
{
	cin >> n >> m;

	for (int i = 1; i <= n; i++) cin >> a[i];

	for (int i = 1; i <= m; i++){
		cin >> b[i];
		b[i] += b[i - 1];
		mx[i] = max(mx[i - 1], b[i]);
		mn[i] = min(mn[i - 1], b[i]);
	}

	a[0] = -INF;
	a[n + 1] = INF;

	for (int i = 1; i <= n; i++){
		//check how much mn you can take 
		int l = 0, r = m, ans = 0;
		while (l != r){
			int mid = (l + r + 1) / 2;

			int p1 = a[i] + mn[mid];
			int p2 = a[i - 1] + mx[mid];

			if (p1 > p2) l = mid;
			else r = mid - 1;
		}

		ans += -mn[l];

		if (l != m){
			int change = b[l + 1] - b[l];
			change += b[l] - mn[l];
			
			if (change < 0){
				int p1 = a[i] + mn[l];
				int p2 = a[i - 1] + mx[l + 1];

				ans += min(-change, p1 - p2);
			}
		}

		l = 0, r = m;
		while (l != r){
			int mid = (l + r + 1)/2;

			int p1 = a[i] + mx[mid];
			int p2 = a[i + 1] + mn[mid];

			if (p1 < p2) l = mid;
			else r = mid - 1;
		}

		ans += mx[l];

		if (l != m){
			int change = b[l + 1] - b[l];
			change -= mx[l] - b[l];

			if (change > 0){
				int p1 = a[i] + mx[l];
				int p2 = a[i + 1] + mn[l + 1];

				ans += min(change, p2 - p1);
			}
		}

		cout << ans << "\n";
	}
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

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