oj.uz

Submission #831568

# Submission time Handle Problem Language Result Execution time Memory
831568 2023-08-20T10:27:34 Z green_gold_dog Snowball (JOI21_ho_t2) C++17
100 / 100
 81 ms 13776 KB 
//#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

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.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct

Subtask #2
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 20 ms 6212 KB Output is correct
21 Correct 19 ms 6020 KB Output is correct
22 Correct 18 ms 5904 KB Output is correct
23 Correct 18 ms 5768 KB Output is correct
24 Correct 22 ms 6084 KB Output is correct
25 Correct 78 ms 11856 KB Output is correct
26 Correct 80 ms 11924 KB Output is correct
27 Correct 75 ms 11484 KB Output is correct
28 Correct 76 ms 11596 KB Output is correct
29 Correct 73 ms 11148 KB Output is correct
30 Correct 75 ms 10528 KB Output is correct
31 Correct 56 ms 9940 KB Output is correct
32 Correct 40 ms 10048 KB Output is correct
33 Correct 7 ms 1496 KB Output is correct
34 Correct 77 ms 12240 KB Output is correct
35 Correct 75 ms 11568 KB Output is correct
36 Correct 81 ms 11856 KB Output is correct
37 Correct 75 ms 11672 KB Output is correct
38 Correct 75 ms 11524 KB Output is correct
39 Correct 70 ms 11592 KB Output is correct
40 Correct 64 ms 11584 KB Output is correct
41 Correct 22 ms 6504 KB Output is correct
42 Correct 39 ms 10044 KB Output is correct
43 Correct 65 ms 13324 KB Output is correct
44 Correct 21 ms 6404 KB Output is correct
45 Correct 45 ms 11600 KB Output is correct
46 Correct 66 ms 13504 KB Output is correct
47 Correct 69 ms 13756 KB Output is correct
48 Correct 66 ms 13776 KB Output is correct