Submission #676194

#	Time	Username	Problem	Language	Result	Execution time	Memory
676194		ghostwriter	Snowball (JOI21_ho_t2)	C++17	100 / 100	120 ms	15340 KiB

Main

// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
    #include <debug.h>
#else
    #define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    GOAT
----------------------------------------------------------------
*/
const ll oo = (ll)1e18 + 5;
const int N = 2e5 + 5;
int n, q;
ll x[N], w[N], maxx[N], minn[N], ans[N];
void input(int test_id) {
	cin >> n >> q;
	FOR(i, 1, n) cin >> x[i];
	FOR(i, 1, q) cin >> w[i];
}
void solve(int test_id) {
	maxx[0] = -oo;
	minn[0] = oo;
	FOR(i, 1, q) {
		w[i] += w[i - 1];
		maxx[i] = max(maxx[i - 1], w[i]);
		minn[i] = min(minn[i - 1], w[i]);
	}
	FOR(i, 1, n - 1) {
		int l = 1, r = q, pos = 0;
		WHILE(l <= r) {
			int mid = l + (r - l) / 2;
			ll mxs = (maxx[mid] > 0? maxx[mid] : 0), mns = (minn[mid] < 0? -minn[mid] : 0);
			if (mxs + mns < x[i + 1] - x[i]) {
				pos = mid;
				l = mid + 1;
			}
			else r = mid - 1;
		}
		ll mxs = (maxx[pos] > 0? maxx[pos] : 0), mns = (minn[pos] < 0? -minn[pos] : 0);
		ans[i] += mxs;
		ans[i + 1] += mns;
		if (pos < q) {
			++pos;
			if (w[pos] < 0) ans[i + 1] += x[i + 1] - x[i] - mxs - mns;
			else ans[i] += x[i + 1] - x[i] - mxs - mns;
		}
	}
	ans[1] += (minn[q] < 0? -minn[q] : 0);
	ans[n] += (maxx[q] > 0? maxx[q] : 0);
	FOR(i, 1, n) cout << ans[i] << '\n';
}
void reinit(int test_id) {

}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    int test_num = 1;
    // cin >> test_num; // comment if the problem does not requires multitest
    FOR(i, 1, test_num) {
        input(i); // input in noninteractive problems for case #i
        solve(i); // main function to solve case #i
        reinit(i); // reinit global data to default used in case #i
    }
    #ifdef LOCAL
        cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
    #endif
    return 0;
}
/*
4 3
-2 3 5 8
2
-4
7
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

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