Submission #831568

#	Time	Username	Problem	Language	Result	Execution time	Memory
831568		green_gold_dog	Snowball (JOI21_ho_t2)	C++17	100 / 100	81 ms	13776 KiB

Main

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, q;
        cin >> n >> q;
        vector<ll> arr(n);
        for (ll i = 0; i < n; i++) {
                cin >> arr[i];
        }
        vector<pair<ll, ll>> all(1, make_pair(0, 0));
        ll now = 0;
        for (ll i = 0; i < q; i++) {
                ll x;
                cin >> x;
                now += x;
                all.emplace_back(min(now, all.back().first), max(now, all.back().second));
        }
        vector<ll> ans(n, 0);
        ans[0] -= all.back().first;
        ans.back() += all.back().second;
        for (ll i = 1; i < n; i++) {
                if (arr[i] - arr[i - 1] >= all.back().second - all.back().first) {
                        ans[i - 1] += all.back().second;
                        ans[i] -= all.back().first;
                        continue;
                }
                ll l = 0, r = q;
                while (r - l > 1) {
                        ll mid = (l + r) / 2;
                        if (arr[i] - arr[i - 1] >= all[mid].second - all[mid].first) {
                                l = mid;
                        } else {
                                r = mid;
                        }
                }
                ans[i - 1] += all[l].second;
                ans[i] -= all[l].first;
                if (all[r].second > all[l].second) {
                        ans[i - 1] += arr[i] - arr[i - 1] + all[l].first - all[l].second;
                } else {
                        ans[i] += arr[i] - arr[i - 1] + all[l].first - all[l].second;
                }
        }
        for (auto i : ans) {
                cout << i << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:98:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
Main.cpp:99:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

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